900 search results - page 81 / 180 » On Polynomial Time Computation over Unordered Structures |
FCT
2005
Springer
14 years 2 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
TIT
2010
13 years 3 months ago
2010
Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In part I, the fundamental limits of asynchronous CDMA systems were analyzed in terms of total cap...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
ADHOCNOW
2004
Springer
14 years 2 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
CHI
2011
ACM
13 years 12 days ago
2011
ACM
We all spend time every day looking for information in our email, yet we know little about this refinding process. Some users expend considerable preparatory effort creating compl...