Sciweavers

1041 search results - page 155 / 209
» Randomizing Reductions of Search Problems
Sort
View
DCC
2003
IEEE
15 years 11 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski
DATE
2009
IEEE
133views Hardware» more  DATE 2009»
15 years 6 months ago
Energy efficient multiprocessor task scheduling under input-dependent variation
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
Jason Cong, Karthik Gururaj
P2P
2009
IEEE
126views Communications» more  P2P 2009»
15 years 6 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...
IROS
2009
IEEE
132views Robotics» more  IROS 2009»
15 years 6 months ago
Segregation in swarms of mobile robots based on the Brazil nut effect
— We study a simple algorithm inspired by the Brazil nut effect for achieving segregation in a swarm of mobile robots. The algorithm lets each robot mimic a particle of a certain...
Roderich Groß, Stéphane Magnenat, Fra...
INFOCOM
2008
IEEE
15 years 6 months ago
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
Animashree Anandkumar, Lang Tong, Ananthram Swami,...