Sciweavers

1091 search results - page 45 / 219
» On the temporal dimension of search
Sort
View
ICTAI
2003
IEEE
15 years 6 months ago
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Benjamin W. Wah, Yixin Chen
WEBI
2009
Springer
15 years 8 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 5 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
PVLDB
2008
174views more  PVLDB 2008»
15 years 1 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
WWW
2007
ACM
16 years 2 months ago
Causal relation of queries from temporal logs
In this paper, we study a new problem of mining causal relation of queries in search engine query logs. Causal relation between two queries means event on one query is the causati...
Yizhou Sun, Kunqing Xie, Ning Liu, Shuicheng Yan, ...