Sciweavers

1813 search results - page 120 / 363
» Instance Pruning Techniques
Sort
View
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
16 years 7 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
16 years 7 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 7 months ago
Go Green: Recycle and Reuse Frequent Patterns
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
16 years 7 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...
ICPR
2008
IEEE
16 years 7 months ago
EK-SVD: Optimized dictionary design for sparse representations
Sparse representations using overcomplete dictionaries are used in a variety of field such as pattern recognition and compression. However, the size of dictionary is usually a tra...
Raazia Mazhar, Paul D. Gader