Sciweavers

430 search results - page 28 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
16 years 4 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
ICWS
2010
IEEE
15 years 5 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke
138
Voted
UAI
2004
15 years 4 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
DATE
2010
IEEE
127views Hardware» more  DATE 2010»
15 years 8 months ago
A generalized control-flow-aware pattern recognition algorithm for behavioral synthesis
— Pattern recognition has many applications in design automation. A generalized pattern recognition algorithm is presented in this paper which can efficiently extract similar pat...
Jason Cong, Hui Huang, Wei Jiang
PRIS
2010
15 years 1 months ago
The Impact of Pre-processing on the Classification of MEDLINE Documents
The amount of information available in the MEDLINE database makes it very hard for a researcher to retrieve a reasonable amount of relevant documents using a simple query language ...
Carlos Adriano Gonçalves, Célia Talm...