Sciweavers

1096 search results - page 38 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
MIR
2004
ACM
171views Multimedia» more  MIR 2004»
15 years 3 months ago
Mean version space: a new active learning method for content-based image retrieval
In content-based image retrieval, relevance feedback has been introduced to narrow the gap between low-level image feature and high-level semantic concept. Furthermore, to speed u...
Jingrui He, Hanghang Tong, Mingjing Li, HongJiang ...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 1 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
TROB
2002
138views more  TROB 2002»
14 years 9 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
164
Voted
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
DAC
2007
ACM
15 years 10 months ago
Alembic: An Efficient Algorithm for CNF Preprocessing
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
HyoJung Han, Fabio Somenzi