Sciweavers

4007 search results - page 752 / 802
» Computation with imprecise probabilities
Sort
View
MOBIHOC
2005
ACM
14 years 8 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
MOBIHOC
2002
ACM
14 years 8 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
EWSN
2006
Springer
14 years 8 months ago
Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks
Nodes in sensor networks often encounter spatially-correlated contention, where multiple nodes in the same neighborhood all sense an event they need to transmit information about....
Kyle Jamieson, Hari Balakrishnan, Y. C. Tay
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 6 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis