Sciweavers

4433 search results - page 645 / 887
» Distributed Multi-Robot Localization
Sort
View
CN
2006
74views more  CN 2006»
15 years 3 months ago
OMNI: An efficient overlay multicast infrastructure for real-time applications
We consider an overlay architecture (called OMNI) where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming appli...
Suman Banerjee, Christopher Kommareddy, Koushik Ka...
COMCOM
2006
213views more  COMCOM 2006»
15 years 3 months ago
Energy efficient information dissemination protocols by negotiation for wireless sensor networks
In this paper we consider a distributed and efficient information dissemination and retrieval system for wireless sensor networks. In such a system each sensor node operates auton...
Dandan Liu, Xiaodong Hu, Xiaohua Jia
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 3 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
FTTCS
2006
132views more  FTTCS 2006»
15 years 3 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
CN
2007
154views more  CN 2007»
15 years 3 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...