Sciweavers

614 search results - page 89 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
FOCS
1999
IEEE
14 years 3 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
ICALP
2005
Springer
14 years 4 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
ICPR
2006
IEEE
14 years 12 months ago
Exploiting High Dimensional Video Features Using Layered Gaussian Mixture Models
Analysis of video data usually requires training classifiers in high dimensional feature spaces. This paper proposes a layered Gaussian mixture model (LGMM) to exploit high dimens...
Datong Chen, Jie Yang
AINA
2008
IEEE
14 years 5 months ago
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
TWC
2010
13 years 5 months ago
Robustness analysis and new hybrid algorithm of wideband source localization for acoustic sensor networks
Wideband source localization using acoustic sensor networks has been drawing a lot of research interest recently in wireless communication applications, such as cellular handset lo...
Kun Yan, Hsiao-Chun Wu, S. Sitharama Iyengar