1099 search results - page 177 / 220 » On the Complexity of Computing Evolutionary Trees |
120
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
121
click to vote
COMGEO
2002
ACM
14 years 9 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
DAM
2011
14 years 4 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...