Sciweavers

2526 search results - page 289 / 506
» A New Algorithm for Answer Set Computation
Sort
View
ISCI
2008
116views more  ISCI 2008»
15 years 6 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
ICPR
2010
IEEE
15 years 4 months ago
Performance Evaluation of Automatic Feature Discovery Focused within Error Clusters
We report performance evaluation of our automatic feature discovery method on the publicly available Gisette dataset: a set of 29 features discovered by our method ranks 129 among...
Sui-Yu Wang, Henry S. Baird
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
GI
2004
Springer
15 years 12 months ago
Type Safe Programming of XML-based Applications
: There is an emerging amount of software for generating and manipulating XML documents. This paper addresses the problem of guaranteeing the validity of dynamically generated XML ...
Martin Kempa, Volker Linnemann
VMV
2001
161views Visualization» more  VMV 2001»
15 years 8 months ago
Viewpoint Selection using Viewpoint Entropy
Computation of good viewpoints is important in several fields: computational geometry, visual servoing, robot motion, graph drawing, etc. In addition, selection of good views is r...
Pere-Pau Vázquez, Miquel Feixas, Mateu Sber...