Sciweavers

779 search results - page 22 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
VLDB
2004
ACM
111views Database» more  VLDB 2004»
15 years 11 months ago
A Framework for Using Materialized XPath Views in XML Query Processing
XML languages, such as XQuery, XSLT and SQL/XML, employ XPath as the search and extraction language. XPath expressions often define complicated navigation, resulting in expensive...
Andrey Balmin, Fatma Özcan, Kevin S. Beyer, R...
CCCG
2010
15 years 7 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
JASIS
2010
170views more  JASIS 2010»
15 years 4 months ago
Analyzing URL queries
This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation and user click-through behavior was examined to determine the intent be...
Wei Meng Lee, Mark Sanderson
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
15 years 11 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...
WWW
2011
ACM
15 years 1 months ago
Learning to re-rank: query-dependent image re-ranking using click data
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
Vidit Jain, Manik Varma