8132 search results - page 1477 / 1627 » Dependability, Abstraction, and Programming |
171
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
210
click to vote
ICALP
2009
Springer
16 years 6 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...
162
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
157
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
149
click to vote
MOBISYS
2003
ACM
16 years 6 months ago
2003
ACM
Wireless transmission of a bit can require over 1000 times more energy than a single 32-bit computation. It would therefore seem desirable to perform significant computation to re...