Sciweavers

868 search results - page 101 / 174
» A general compression algorithm that supports fast searching
Sort
View
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 9 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 9 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 9 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
CLEF
2006
Springer
14 years 25 days ago
GeoCLEF Text Retrieval and Manual Expansion Approaches
In this paper we will describe the Berkeley approaches to the GeoCLEF tasks for CLEF 2006. This year we used two separate systems for different tasks. Although of the systems both...
Ray R. Larson, Fredric C. Gey
GECCO
2008
Springer
177views Optimization» more  GECCO 2008»
13 years 10 months ago
Reduced computation for evolutionary optimization in noisy environment
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
Maumita Bhattacharya