1489 search results - page 116 / 298 » Optimizing Feature Sets for Structured Data |
PKDD
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
143
click to vote
PODS
1997
ACM
15 years 2 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
105
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—We study the ubiquitous data collection for mobile users in wireless sensor networks. People with handheld devices can easily interact with the network and collect data....
161
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
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...
CVPR
2006
IEEE
15 years 12 months ago
2006
IEEE
In this paper, we address the problem of 3D volume reconstruction from depth adjacent subvolumes (i.e., sets of image frames) acquired using a confocal laser scanning microscope (...