Sciweavers

587 search results - page 36 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Sorting and Selection in Posets
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...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
CIKM
2006
Springer
14 years 12 days ago
A combination of trie-trees and inverted files for the indexing of set-valued attributes
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...
Manolis Terrovitis, Spyros Passas, Panos Vassiliad...
DEXA
2006
Springer
151views Database» more  DEXA 2006»
13 years 10 months ago
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS
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...
Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger
SIGMOD
2002
ACM
118views Database» more  SIGMOD 2002»
14 years 8 months ago
Compressing SQL workloads
Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importan...
Surajit Chaudhuri, Ashish Kumar Gupta, Vivek R. Na...
DCC
2002
IEEE
14 years 8 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
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 (...
Alexander E. Mohr