Sciweavers

265 search results - page 37 / 53
» Approximation algorithms for clustering uncertain data
Sort
View
CVPR
2005
IEEE
15 years 11 months ago
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
Kai Zhang, Ming Tang, James T. Kwok
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
15 years 3 months ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon
ICDCN
2009
Springer
15 years 2 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
PR
2008
170views more  PR 2008»
14 years 9 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
ICCV
2009
IEEE
16 years 2 months ago
Shape-based Recognition of 3D Point Clouds in Urban Environments
This paper investigates the design of a system for recognizing objects in 3D point clouds of urban environments. The system is decomposed into four steps: locating, segmenting, ...
Aleksey Golovinskiy, Vladimir G. Kim, Thomas Funkh...