Sciweavers

1100 search results - page 169 / 220
» Approximate distance oracles
Sort
View
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 5 months ago
Line-of-sight networks
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...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
134
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Robust multi-source network tomography using selective probes
—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 ...
Akshay Krishnamurthy, Aarti Singh
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 6 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
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...
Liangda Li, Guy Lebanon, Haesun Park
CVPR
2008
IEEE
16 years 5 months ago
In defense of Nearest-Neighbor based image classification
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...
Oren Boiman, Eli Shechtman, Michal Irani
133
Voted
ECCV
2006
Springer
16 years 5 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
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...
Haibin Ling, Kazunori Okada