Sciweavers

4229 search results - page 233 / 846
» On the Optimality of Spiral Search
Sort
View
SIGMOD
2010
ACM
204views Database» more  SIGMOD 2010»
14 years 11 months ago
Multi-dimensional keyword-based image annotation and search
Effective keyword search on image databases is a major open problem, due to the inherent imprecision of keywords (tags) used to describe images' content. In this paper we pre...
Ilaria Bartolini, Paolo Ciaccia
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 8 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 1 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
97
Voted
WSDM
2010
ACM
242views Data Mining» more  WSDM 2010»
15 years 11 months ago
Improving Ad Relevance in Sponsored Search
We describe a machine learning approach for predicting sponsored search ad relevance. Our baseline model incorporates basic features of text overlap and we then extend the model t...
Dustin Hillard, Stefan Schroedl, Eren Manavoglu, H...
WEBI
2009
Springer
15 years 8 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova