Sciweavers

2635 search results - page 435 / 527
» Algorithms for the Database Layout Problem
Sort
View
KDD
2004
ACM
216views Data Mining» more  KDD 2004»
16 years 4 months ago
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
Jieping Ye, Ravi Janardan, Qi Li
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
16 years 4 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
SIGMOD
2009
ACM
214views Database» more  SIGMOD 2009»
16 years 4 months ago
DDE: from dewey to a fully dynamic XML labeling scheme
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 4 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
16 years 4 months ago
DiMaC: a system for cleaning disguised missing data
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei