587 search results - page 36 / 118 » On the Relative Sizes of Learnable Sets |
80
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
67
Voted
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
Set-valued attributes frequently occur in contexts like marketbasked analysis and stock market trends. Late research literature has mainly focused on set containment joins and dat...
DEXA
2006
Springer
14 years 11 months ago
2006
Springer
Geographic information systems (GIS) must support large georeferenced data sets. Due to the size of these data sets finding exact answers to spatial queries can be very time consum...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importan...
DCC
2002
IEEE
15 years 9 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...