15754 search results - page 3050 / 3151 » Programs are Knowledge Bases |
139
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
149
click to vote
ICALP
2009
Springer
16 years 4 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...
174
click to vote
ICALP
2009
Springer
16 years 4 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...
139
click to vote
ICALP
2009
Springer
16 years 4 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...
132
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...