Sciweavers

44 search results - page 8 / 9
» Improvement on Ha-Moon Randomized Exponentiation Algorithm
Sort
View
PODC
2010
ACM
13 years 8 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 5 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
INFOCOM
2006
IEEE
13 years 10 months ago
Utility-Optimal Medium Access Control: Reverse and Forward Engineering
— This paper analyzes and designs medium access control (MAC) protocols for wireless ad-hoc networks through the network utility maximization (NUM) framework. We first reverse-e...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank
ICALP
2005
Springer
13 years 10 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
JBI
2004
171views Bioinformatics» more  JBI 2004»
13 years 6 months ago
Consensus Clustering and Functional Interpretation of Gene Expression Data
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
Paul Kellam, Stephen Swift, Allan Tucker, Veronica...