Sciweavers

1093 search results - page 77 / 219
» Probabilistic Location and Routing
Sort
View
123
Voted
ENTCS
2006
134views more  ENTCS 2006»
15 years 3 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
126
Voted
VLDB
2005
ACM
110views Database» more  VLDB 2005»
15 years 9 months ago
U-DBMS: A Database System for Managing Constantly-Evolving Data
In many systems, sensors are used to acquire information from external environments such as temperature, pressure and locations. Due to continuous changes in these values, and lim...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar
129
Voted
IJCAI
2003
15 years 5 months ago
A Learning Algorithm for Localizing People Based on Wireless Signal Strength that Uses Labeled and Unlabeled Data
This paper summarizes a probabilistic approach for localizing people through the signal strengths of a wireless IEEE 802.11b network. Our approach uses data labeled by ground trut...
Sebastian Thrun, Geoffrey J. Gordon, Frank Pfennin...
132
Voted
ICNP
2006
IEEE
15 years 9 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
133
Voted
DAC
1997
ACM
15 years 7 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao