Sciweavers

1047 search results - page 41 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
APWEB
2004
Springer
14 years 1 months ago
Semantic, Hierarchical, Online Clustering of Web Search Results
Today, search engine is the most commonly used tool for Web information retrieval, however, its current status is still far from satisfaction. This paper focuses on clustering Web...
Dell Zhang, Yisheng Dong
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 8 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 1 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
13 years 11 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
CAV
2007
Springer
120views Hardware» more  CAV 2007»
14 years 1 months ago
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc...