1100 search results - page 98 / 220 » Approximate distance oracles |
CGF
2010
14 years 10 months ago
2010
We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous...
101
click to vote
ALGORITHMICA
2011
14 years 5 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
135
click to vote
WIOPT
2011
IEEE
14 years 1 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
106
click to vote
PAMI
2012
13 years 17 days ago
2012
—We introduce a simple image descriptor referred to as the image signature. We show, within the theoretical framework of sparse signal mixing, that this quantity spatially approx...
TKDE
2008
14 years 10 months ago
2008
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...