Sciweavers

888 search results - page 151 / 178
» Improving Random Projections Using Marginal Information
Sort
View
ECCV
2004
Springer
16 years 1 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
ANSS
2007
IEEE
15 years 6 months ago
Scalable Data Collection Protocols for Wireless Sensor Networks with Multiple Mobile Sinks
Data propagation in wireless sensor networks is usually performed as a multihop process. To deliver a single message, the resources of many sensor nodes are used and a lot of ener...
Athanasios Kinalis, Sotiris E. Nikoletseas
78
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
Shape Segmentation and Applications in Sensor Networks
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
Xianjin Zhu, Rik Sarkar, Jie Gao
CCGRID
2005
IEEE
15 years 5 months ago
n-Cycle: a set of algorithms for task distribution on a commodity grid
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...
WOSP
2005
ACM
15 years 5 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills