Sciweavers

6846 search results - page 384 / 1370
» Querying a summary of database
Sort
View
ICPR
2010
IEEE
15 years 10 months ago
Improving the Efficiency of Content-Based Multimedia Exploration
Visual exploration systems enable users to search, browse, and explore voluminous multimedia databases in an interactive and playful manner. Whether users know the database's ...
Christian Beecks, Sascha Wiedenfeld, Thomas Seidl
ACTA
2002
111views more  ACTA 2002»
15 years 6 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
WWW
2011
ACM
15 years 1 months ago
Improving recommendation for long-tail queries via templates
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
Idan Szpektor, Aristides Gionis, Yoelle Maarek
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
16 years 8 months ago
Designing and Evaluating an XPath Dialect for Linguistic Queries
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
Steven Bird, Yi Chen, Susan B. Davidson, Haejoong ...
EDBT
2004
ACM
162views Database» more  EDBT 2004»
16 years 7 months ago
Non-contiguous Sequence Pattern Queries
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
Nikos Mamoulis, Man Lung Yiu