Publications

Found 104 results
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is D  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
D
De Carli, L., Sommer R., & Jha S. (2014).  Beyond Pattern Matching: A Concurrency Model for Stateful Deep Packet Inspection.
Davidovich, O.., Kimmel G., Halperin E., & Shamir R. (2009).  Increasing the Power of Association Studies by Imputation-Based Sparse Tag SNP Selection. Communications in Information and Systems. 9(3), 269-282.
David, O., Stickles E., Hong J., Dodge E., & Sweetser E. (2014).  Building the MetaNet Metaphor Repository: The Natural Symbiosis of Metaphor Analysis and Construction Grammar.
David, O. (2014).  Frame Metonymy and Null Instantiation of Frame Elements: Insights from Embodied Construction Grammar.
Datta, A., Lu J., & Tschantz M. Carl (2019).  Evaluating Anti-Fingerprinting Privacy Enhancing Technologies. Proceedings of the WWW'19 (World Wide Web Conference).
Datta, A., Tschantz M. Carl, & Datta A. (2015).  Automated Experiments on Ad Privacy Settings: A Tale of Opacity, Choice, and Discrimination. Proceedings on Privacy Enhancing Technologies. 2015(1), 92-112.
Daskalakis, C., Dimakis A.. G., Karp R. M., & Wainwright M.. J. (2008).  Probabilistic Analysis of Linear Programming Decoding. IEEE Transactions on Information Theory. 54(8), 3565-3578.
Daskalakis, C., Karp R. M., Mossel E., Riesenfeld S., & Verbin E.. (2009).  Sorting and Selection in Posets. 392-401.
Dasgupta, S., & Gupta A. (1999).  An Elementary Proof of the Johnson-Lindenstrauss Lemma.
Darrell, T., Kloft M., Pontil M., Rätsch G., & Rodner E. (2015).  Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152). Dagstuhl Reports. 5, 18–55.
Darken, C., & Moody J. (1990).  Fast, Adaptive K-Means Clustering: Some Empirical Results. Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN 1990).
Darken, C., & Moody J. (1991).  Note on Learning Rate Schedules for Stochastic Optimization. 3,
Darken, C., & Moody J. (1992).  Towards Faster Stochastic Gradient Search. 4,
Darken, C., Chang J.., & Moody J. (1992).  Learning Rate Schedules for Faster Stochastic Gradient Search. Neural Networks for Signal Processing.
Damaskos, S., & Verma D. C. (1989).  Fast Establishment of Real-Time Channels.
Damaskos, S., & Verma D. C. (1989).  Multiplexing Real-Time Channels.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the 3MIS Problem.
Dahlhaus, E., Hajnal P., & Karpinski M. (1989).  Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs.
Dahlhaus, E., & Karpinski M. (1994).  On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs.
Dahlhaus, E., Karpinski M., & Novick M. B. (1989).  Fast Parallel Algorithms for the Clique Separator Decomposition.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO).
Dahlhaus, E., Karpinski M., & Kelsen P. (1992).  An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Dagum, P., & Luby M. (1989).  Approximating the Permanent of Graphs with Large Factors.
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte Carlo Estimation. 29,
Dagum, P. (1990).  On the Magnification of Exchange Graphs with Applications to Enumeration Problems (Thesis).

Pages