Sciweavers

47 search results - page 8 / 10
» Foundations of non-commutative probability theory
Sort
View
MOBIHOC
2002
ACM
14 years 5 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
COCOON
2003
Springer
13 years 11 months ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
CORR
2010
Springer
184views Education» more  CORR 2010»
13 years 5 months ago
Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
Xiang He, Aylin Yener
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 3 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
IPSN
2007
Springer
13 years 12 months ago
Tracking multiple targets using binary proximity sensors
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar 0003...