Sciweavers

238 search results - page 47 / 48
» Parallel Algorithm for Maximum Weight Matching in Trees
Sort
View
PODC
2009
ACM
14 years 6 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
SPAA
2006
ACM
14 years 6 days ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
ASPDAC
2005
ACM
93views Hardware» more  ASPDAC 2005»
13 years 8 months ago
Power minimization for dynamic PLAs
—Dynamic programmable logic arrays (PLAs) which are built of the NOR–NOR structure, have been very popular in high performance design because of their high-speed and predictabl...
Tzyy-Kuen Tien, Chih-Shen Tsai, Shih-Chieh Chang, ...
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 6 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
TCBB
2008
93views more  TCBB 2008»
13 years 6 months ago
2SNP: Scalable Phasing Method for Trios and Unrelated Individuals
Emerging microarray technologies allow affordable typing of very long genome sequences. A key challenge in analyzing of such huge amount of data is scalable and accurate computatio...
Dumitru Brinza, Alexander Zelikovsky