2200 search results - page 366 / 440 » Bloch's Constant is Computable |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
CHI
2003
ACM
15 years 10 months ago
2003
ACM
Large wall-sized displays are becoming prevalent. Although researchers have articulated qualitative benefits of group work on large displays, little work has been done to quantify...
168
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...