2593 search results - page 153 / 519 » Algorithms and Data Structures for Computer Topology |
136
click to vote
PODS
2010
ACM
15 years 10 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
171
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
147
click to vote
VISUALIZATION
1999
IEEE
15 years 9 months ago
1999
IEEE
We present a method for the hierarchical representation of vector fields. Our approach is based on iterative refinement using clustering and principal component analysis. The inpu...
130
click to vote
STOC
2010
ACM
16 years 2 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
153
click to vote
PODS
2007
ACM
16 years 5 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...