9842 search results - page 1611 / 1969 » The Complexity of the Matching-Cut Problem |
198
click to vote
CIAC
2010
Springer
16 years 4 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
162
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
187
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
167
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
— In today’s complex SoC designs, verification and debugging are becoming ever more crucial and increasingly timeconsuming tasks. The prevalence of embedded memories adds to t...
158
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...