Sciweavers

1734 search results - page 303 / 347
» MSDR-D Network Localization Algorithm
Sort
View
COMPGEOM
2004
ACM
14 years 3 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
SPAA
1997
ACM
14 years 2 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
14 years 7 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
DAC
1996
ACM
14 years 2 months ago
Optimal Clock Skew Scheduling Tolerant to Process Variations
1- A methodology is presented in this paper for determining an optimal set of clock path delays for designing high performance VLSI/ULSI-based clock distribution networks. This met...
José Luis Neves, Eby G. Friedman
ADHOC
2007
122views more  ADHOC 2007»
13 years 10 months ago
Modeling and analyzing the correctness of geographic face routing under realistic conditions
Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geograph...
Karim Seada, Ahmed Helmy, Ramesh Govindan