Sciweavers

1639 search results - page 265 / 328
» Anytime Heuristic Search
Sort
View
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
14 years 9 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
KDD
2002
ACM
186views Data Mining» more  KDD 2002»
14 years 9 months ago
Topic-conditioned novelty detection
Automated detection of the first document reporting each new event in temporally-sequenced streams of documents is an open challenge. In this paper we propose a new approach which...
Yiming Yang, Jian Zhang, Jaime G. Carbonell, Chun ...
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 8 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 8 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
ICSE
2003
IEEE-ACM
14 years 8 months ago
Constructing Test Suites for Interaction Testing
Software system faults are often caused by unexpected interactions among components. Yet the size of a test suite required to test all possible combinations of interactions can be...
Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugrid...