Sciweavers

6506 search results - page 912 / 1302
» Algorithmic models for sensor networks
Sort
View
IPPS
1998
IEEE
15 years 8 months ago
Deterministic Routing of h-relations on the Multibutterfly
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing th...
Andrea Pietracaprina
JMLR
2006
104views more  JMLR 2006»
15 years 4 months ago
Learning Image Components for Object Recognition
In order to perform object recognition it is necessary to learn representations of the underlying components of images. Such components correspond to objects, object-parts, or fea...
Michael W. Spratling
PAMI
2011
14 years 7 months ago
Richardson-Lucy Deblurring for Scenes under a Projective Motion Path
— This paper addresses how to model and correct image blur that arises when a camera undergoes ego motion while observing a distant scene. In particular, we discuss how the blurr...
Yu-Wing Tai, Ping Tan, Michael S. Brown
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 4 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
16 years 4 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...