Sciweavers

2489 search results - page 178 / 498
» On the Subgroup Distance Problem
Sort
View
TMC
2008
112views more  TMC 2008»
15 years 4 months ago
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
Sensor deployment is a critical issue because it affects the cost and detection capability of a wireless sensor network. In this work, we consider two related deployment problems: ...
You-Chiun Wang, Chun-Chi Hu, Yu-Chee Tseng
ECCV
2002
Springer
16 years 6 months ago
Another Way of Looking at Plane-Based Calibration: The Centre Circle Constraint
Abstract. The plane-based calibration consists in recovering the internal parameters of the camera from the views of a planar pattern with a known geometric structure. The existing...
Alain Crouzil, Pierre Gurdjos, René Payriss...
ICPR
2002
IEEE
16 years 5 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
16 years 4 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
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