1100 search results - page 169 / 220 » Approximate distance oracles |
SODA
2007
ACM
14 years 11 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
INFOCOM
2012
IEEE
13 years 12 days ago
2012
IEEE
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...
111
click to vote
KDD
2012
ACM
13 years 11 days ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
CVPR
2008
IEEE
15 years 12 months ago
2008
IEEE
State-of-the-art image classification methods require an intensive learning/training stage (using SVM, Boosting, etc.) In contrast, non-parametric Nearest-Neighbor (NN) based imag...
ECCV
2006
Springer
15 years 12 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...