Sciweavers

5580 search results - page 624 / 1116
» Randomized priority algorithms
Sort
View
WADS
2007
Springer
96views Algorithms» more  WADS 2007»
15 years 11 months ago
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
Martin Farach-Colton, Miguel A. Mosteiro
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
15 years 11 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
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...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
IWCMC
2006
ACM
15 years 10 months ago
Analysis of mobile beacon aided in-range localization scheme in ad hoc wireless sensor networks
In this paper, We mathematically model the In-Range localization scheme in the presence of a Mobile Beacon. In the In-Range localization scheme, a sensor with unknown location is ...
T. V. Srinath, Anil Kumar Katti, V. S. Ananthanara...
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 10 months ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel
150
Voted
AP2PC
2004
Springer
15 years 10 months ago
Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
George H. L. Fletcher, Hardik A. Sheth, Katy B&oum...