Sciweavers

5580 search results - page 691 / 1116
» Randomized priority algorithms
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 5 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
BMCBI
2010
183views more  BMCBI 2010»
15 years 4 months ago
Active learning for human protein-protein interaction prediction
Background: Biological processes in cells are carried out by means of protein-protein interactions. Determining whether a pair of proteins interacts by wet-lab experiments is reso...
Thahir P. Mohamed, Jaime G. Carbonell, Madhavi Gan...
CORR
2006
Springer
117views Education» more  CORR 2006»
15 years 4 months ago
Distributed Transmit Beamforming using Feedback Control
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the funda...
Raghuraman Mudumbai, J. Hespanha, Upamanyu Madhow,...
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
15 years 4 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
JAIR
2000
123views more  JAIR 2000»
15 years 4 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill