David Eppstein - PDFSEARCH.IO - Document Search Engine

David Eppstein
Results: 48

#	Item
1	Young Researcher Forum ‣ Rodrigo Silveira (chair) ‣ Benjamin Burton ‣ David Eppstein ‣ Matthew Katz ‣ Matias Korman Add to Reading List Source URL: www.computational-geometry.org Language: English - Date: 2015-06-26 05:15:11
2	Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011 Add to Reading List Source URL: www.dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:56 Graph theory Mathematics Network theory Routing algorithms Edsger W. Dijkstra Spanning tree Bipartite graphs Shortest path problem Tree Graph Geographic routing Routing
3	Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Mathematics Statistics Applied mathematics Data mining Search algorithms Approximation algorithms Discrete geometry Nearest neighbor search Numerical analysis Hierarchical clustering Cluster analysis K-means clustering
4	Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Mathematics Geometry Computer science Search algorithms Discrete geometry Computational geometry Mathematical optimization Closest pair of points problem Nearest neighbor search Nearest neighbor graph K-nearest neighbors algorithm Euclidean minimum spanning tree
5	Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati Add to Reading List Source URL: www.cs.siu.edu Language: English - Date: 2015-11-12 17:19:02 NP-complete problems Theoretical computer science Analysis of algorithms Parameterized complexity Independent set Algorithm Kernelization Book:Graph Theory Book:Graph Algorithms
6	On the NP-Completeness of Cryptarithms David Eppstein Computer Science Department Columbia University New York, NYJune 8, 2000 Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2000-06-09 02:38:14
7	Young Researcher Forum ‣ Rodrigo Silveira (chair) ‣ Benjamin Burton ‣ David Eppstein ‣ Matthew Katz ‣ Matias Korman Add to Reading List Source URL: computational-geometry.org Language: English - Date: 2015-06-26 05:15:11
8	Parametric and Kinetic Minimum Spanning Trees Pankaj K. Agarwal David Eppstein y Abstract Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2011-12-02 14:31:02
9	Spanning Trees and Spanners David Eppstein∗ Dept. Information and Computer Science University of California, Irvine, CAhttp://www.ics.uci.edu/∼eppstein/ Tech. Report 96-16 Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-03-21 16:08:27
10	Deterministic Sampling and Range Counting in Geometric Data Streams Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, and Michael T. Goodrich School of Information and Computer Science, University of California, Irvine Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-03-20 12:29:58

UPDATE