Sciweavers

220 search results - page 35 / 44
» Distributed Minimum Cut Approximation
Sort
View
120
Voted
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 4 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
TSP
2008
115views more  TSP 2008»
15 years 3 months ago
A Bayesian Approach to Adaptive Detection in Nonhomogeneous Environments
Abstract--We consider the adaptive detection of a signal of interest embedded in colored noise, when the environment is nonhomogeneous, i.e., when the training samples used for ada...
Stéphanie Bidon, Olivier Besson, Jean-Yves ...
COMPGEOM
2006
ACM
15 years 10 months ago
Embedding ultrametrics into low-dimensional spaces
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
VLDB
2004
ACM
127views Database» more  VLDB 2004»
16 years 4 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
INFOCOM
2006
IEEE
15 years 10 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman