1756 search results - page 182 / 352 » Mining Query Logs |
147
Voted
SWAT
2000
Springer
15 years 7 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
161
Voted
CCS
2008
ACM
15 years 6 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
133
Voted
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
136
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
154
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...