Sciweavers

3497 search results - page 29 / 700
» Making Distributed Applications Robust
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CIKM
2007
Springer
15 years 6 months ago
Query expansion using probabilistic local feedback with application to multimedia retrieval
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
Rong Yan, Alexander G. Hauptmann
INFOCOM
2012
IEEE
13 years 2 months ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu
TIP
2010
170views more  TIP 2010»
14 years 6 months ago
A Distributed Topological Camera Network Representation for Tracking Applications
Abstract--Sensor networks have been widely used for surveillance, monitoring, and tracking. Camera networks, in particular, provide a large amount of information that has tradition...
Edgar J. Lobaton, Ramanarayan Vasudevan, Ruzena Ba...
ICIP
2003
IEEE
16 years 1 months ago
Rotation-invariant features based on steerable transforms with an application to distributed image classification
In this paper, we propose a new rotation-invariant image retrieval system based on steerable pyramids and the concept of angular alignment across scales. First, we define energy-b...
Baltasar Beferull-Lozano, Antonio Ortega, Hua Xie