Sciweavers

430 search results - page 33 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 27 days ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
DAWAK
2000
Springer
15 years 2 months ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
TC
1998
14 years 10 months ago
Abstraction Techniques for Validation Coverage Analysis and Test Generation
ion Techniques for Validation Coverage Analysis and Test Generation Dinos Moundanos, Jacob A. Abraham, Fellow, IEEE, and Yatin V. Hoskote —The enormous state spaces which must be...
Dinos Moundanos, Jacob A. Abraham, Yatin Vasant Ho...
TACAS
2005
Springer
158views Algorithms» more  TACAS 2005»
15 years 4 months ago
Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution
Object-oriented unit tests consist of sequences of method invocations. Behavior of an invocation depends on the method’s arguments and the state of the receiver at the beginning ...
Tao Xie, Darko Marinov, Wolfram Schulte, David Not...
ICDE
1998
IEEE
187views Database» more  ICDE 1998»
15 years 12 months ago
Mining Optimized Association Rules with Categorical and Numeric Attributes
?Mining association rules on large data sets has received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a ...
Rajeev Rastogi, Kyuseok Shim