756 search results - page 123 / 152 » Recent progress with BOXES |
STOC
2004
ACM
16 years 1 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...
186
Voted
VLDB
2004
ACM
16 years 1 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....
192
Voted
SIGMOD
2008
ACM
16 years 29 days ago
2008
ACM
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
200
Voted
SIGMOD
2008
ACM
16 years 29 days ago
2008
ACM
Data integration systems offer a uniform interface to a set of data sources. Despite recent progress, setting up and maintaining a data integration application still requires sign...
204
click to vote
SIGMOD
2006
ACM
16 years 29 days ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...