Sciweavers

184 search results - page 34 / 37
» Two New Criteria for Comparison in the Bruhat Order
Sort
View
JCST
2008
119views more  JCST 2008»
13 years 6 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
KBS
2006
92views more  KBS 2006»
13 years 6 months ago
Two-level speech recognition to enhance the performance of spoken dialogue systems
Spoken dialogue systems can be considered knowledge-based systems designed to interact with users using speech in order to provide information or carry out simple tasks. Current s...
Ramón López-Cózar, Zoraida Ca...
TSE
2008
165views more  TSE 2008»
13 years 6 months ago
A Systematic Study of Failure Proximity
Software end users are the best testers, who keep revealing bugs in software that has undergone rigorous in-house testing. In order to leverage their testing efforts, failure repor...
Chao Liu 0001, Xiangyu Zhang, Jiawei Han
DAC
2001
ACM
14 years 7 months ago
Chaff: Engineering an Efficient SAT Solver
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao,...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 7 months ago
Tensor-CUR decompositions for tensor-based data
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
Michael W. Mahoney, Mauro Maggioni, Petros Drineas