1999 search results - page 8 / 400 » Finding Reductions Automatically |
101
click to vote
EDBT
2012
ACM
13 years 14 hour ago
2012
ACM
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...
DAC
1996
ACM
15 years 1 months ago
1996
ACM
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
JACM
2006
14 years 9 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
CIARP
2006
Springer
15 years 1 months ago
2006
Springer
Feature selection and dimensionality reduction are crucial research fields in pattern recognition. This work presents the application of a novel technique on dimensionality reducti...