Sciweavers

4886 search results - page 456 / 978
» Approximate Data Exchange
Sort
View
INFOCOM
2011
IEEE
14 years 10 months ago
Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd
—Opportunistic ad-hoc communication enables portable devices such as smartphones to effectively exchange information, taking advantage of their mobility and locality. The nature ...
Gjergji Zyba, Geoffrey M. Voelker, Stratis Ioannid...
ICPR
2006
IEEE
16 years 8 months ago
Scene recovery from many randomly distributed single pixel cameras
This paper examines two scene recovery problems arising when interpreting data from massive numbers of randomly distributed single pixel cameras. Assuming that the camera position...
Robert B. Fisher
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 7 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
CIMCA
2005
IEEE
16 years 13 days ago
Statistical Learning Procedure in Loopy Belief Propagation for Probabilistic Image Processing
We give a fast and practical algorithm for statistical learning hyperparameters from observable data in probabilistic image processing, which is based on Gaussian graphical model ...
Kazuyuki Tanaka
PSIVT
2009
Springer
139views Multimedia» more  PSIVT 2009»
15 years 11 months ago
Recovery Rate of Clustering Algorithms
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
Fajie Li, Reinhard Klette