256 search results - page 6 / 52 » A New Synchronous Lower Bound for Set Agreement |
STOC
2002
ACM
14 years 9 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
PAKDD
2009
ACM
14 years 1 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
—We propose a new approach to evaluate the ultimate performance limit of time synchronization in wireless sensor networks based on the estimation theory. In particular the lower ...