10435 search results - page 2035 / 2087 » Computational Biology and Language |
STOC
2004
ACM
15 years 12 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
100
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
117
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...