21324 search results - page 3958 / 4265 » Making the case for computing |
134
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
115
click to vote
OSDI
2006
ACM
16 years 4 months ago
2006
ACM
Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performa...
140
click to vote
OSDI
2002
ACM
16 years 4 months ago
2002
ACM
Combining high performance with low power consumption is becoming one of the primary objectives of processor designs. Instead of relying just on sleep mode for conserving power, a...
217
click to vote
VLDB
2004
ACM
16 years 4 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
224
Voted
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...