Sciweavers

1541 search results - page 214 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
CHES
2008
Springer
146views Cryptology» more  CHES 2008»
13 years 10 months ago
Power and Fault Analysis Resistance in Hardware through Dynamic Reconfiguration
Dynamically reconfigurable systems are known to have many advantages such as area and power reduction. The drawbacks of these systems are the reconfiguration delay and the overhead...
Nele Mentens, Benedikt Gierlichs, Ingrid Verbauwhe...
MOBIHOC
2006
ACM
14 years 7 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
14 years 5 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
Eric Lehman, Rina Panigrahy
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
13 years 11 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle