Sciweavers

6251 search results - page 376 / 1251
» Randomness, Computability, and Density
Sort
View
LCN
2007
IEEE
16 years 1 months ago
Search Algorithms for Unstructured Peer-to-Peer Networks
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Reza Dorrigiv, Alejandro López-Ortiz, Pawel...
INFOCOM
2011
IEEE
14 years 10 months ago
Aggregation capacity of wireless sensor networks: Extended network case
—A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a s...
Cheng Wang, Changjun Jiang, Yunhao Liu, Xiang-Yang...
152
Voted
ICPR
2008
IEEE
16 years 8 months ago
Geodesic K-means clustering
We introduce a class of geodesic distances and extend the K-means clustering algorithm to employ this distance metric. Empirically, we demonstrate that our geodesic K-means algori...
Arian Maleki, Nima Asgharbeygi
110
Voted
ICPR
2008
IEEE
16 years 8 months ago
Vector field resampling using local streamline approximation
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
Mani Thomas, Chandra Kambhamettu, Cathleen A. Geig...
ICPR
2006
IEEE
16 years 7 months ago
A 'No Panacea Theorem' for Multiple Classifier Combination
We introduce the `No Panacea Theorem' for classifier combination in the two-classifier, two-class case. It states that if the combination function is continuous and diverse, ...
Robert I. Damper, Roland Hu