948 search results - page 101 / 190 » What can we achieve by arbitrary announcements |
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
SBACPAD
2006
IEEE
2006
IEEE
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
14 years 2 months ago
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
FAST
2009
13 years 6 months ago
2009
Clustered applications in storage area networks (SANs), widely adopted in enterprise datacenters, have traditionally relied on distributed locking protocols to coordinate concurre...
CRV
2004
IEEE
14 years 20 days ago
2004
IEEE
- This paper presents a global method to process monocular image sequences for mobile robot obstacle detection. We do not aim to achieve a complete scene reconstruction, but only t...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...