Sciweavers

779 search results - page 11 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
11 years 10 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
DOCENG
2004
ACM
14 years 29 days ago
Presenting the results of relevance-oriented search over XML documents
In this paper, we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resu...
Alda Lopes Gançarski, Pedro Rangel Henrique...
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 7 months ago
Similarity Search on Time Series Based on Threshold Queries
Similarity search in time series data is required in many application fields. The most prominent work has focused on similarity search considering either complete time series or si...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...
DKE
2007
153views more  DKE 2007»
13 years 7 months ago
Adaptive similarity search in streaming time series with sliding windows
The challenge in a database of evolving time series is to provide efficient algorithms and access methods for query processing, taking into consideration the fact that the databas...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
IPM
2007
129views more  IPM 2007»
13 years 7 months ago
Examining the effectiveness of real-time query expansion
Interactive query expansion (IQE) (c.f. Efthimiadis, 1996) is a potentially useful technique to help searchers formulate improved query statements, and ultimately retrieve better ...
Ryen W. White, Gary Marchionini