Sciweavers

3223 search results - page 9 / 645
» The Scaling of Search Cost
Sort
View
DKE
2002
107views more  DKE 2002»
13 years 7 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
PAMI
2010
184views more  PAMI 2010»
13 years 6 months ago
Accurate Image Search Using the Contextual Dissimilarity Measure
— This paper introduces the contextual dissimilarity measure which significantly improves the accuracy of bag-offeatures based image search. Our measure takes into account the l...
Herve Jegou, Cordelia Schmid, Hedi Harzallah, Jako...
IPTPS
2005
Springer
14 years 1 months ago
Arpeggio: Metadata Searching and Content Sharing with Chord
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
Austin T. Clements, Dan R. K. Ports, David R. Karg...
28
Voted
CHI
2006
ACM
14 years 8 months ago
A large scale study of wireless search behavior: Google mobile search
We present a large scale study of search patterns on Google's mobile search interface. Our goal is to understand the current state of wireless search by analyzing over 1 Mill...
Maryam Kamvar, Shumeet Baluja
TCS
2008
13 years 7 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa