Sciweavers

828 search results - page 140 / 166
» Bounded Hairpin Completion
Sort
View
SAC
2006
ACM
14 years 3 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
SIGMETRICS
2004
ACM
14 years 3 months ago
Multicast protocols for scalable on-demand download
Previous scalable protocols for downloading large, popular files from a single server include batching and cyclic multicast. With batching, clients wait to begin receiving a reque...
Niklas Carlsson, Derek L. Eager, Mary K. Vernon
ICALP
2004
Springer
14 years 3 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
SIGAL
1990
273views Algorithms» more  SIGAL 1990»
14 years 1 months ago
Randomized Broadcast in Networks
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...