Sciweavers

3686 search results - page 633 / 738
» Context Query in Information Retrieval
Sort
View
DAGSTUHL
2004
15 years 5 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
ACL
1998
15 years 5 months ago
Dialogue Management in Vector-Based Call Routing
This paper describes a domain independent, automatically trained call router which directs customer calls based on their response to an open-ended "How may I direct your call...
Jennifer Chu-Carroll, Bob Carpenter
IS
2007
15 years 3 months ago
Schema-conscious XML indexing
User queries on extensible markup language (XML) documents are typically expressed as regular path expressions. A variety of indexing techniques for efficiently retrieving the re...
Krishna P. Leela, Jayant R. Haritsa
TKDE
1998
142views more  TKDE 1998»
15 years 3 months ago
Performance Analysis of Three Text-Join Algorithms
—When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a ...
Weiyi Meng, Clement T. Yu, Wei Wang 0010, Naphtali...
WEBI
2010
Springer
15 years 1 months ago
Expertise Matching via Constraint-Based Optimization
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
Wenbin Tang, Jie Tang, Chenhao Tan