1299 search results - page 49 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
176
click to vote
DAM
2000
15 years 5 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
193
click to vote
COLING
2002
15 years 5 months ago
2002
In this paper we investigate the task of automatically identifying the correct argument structure for a set of verbs. The argument structure of a verb allows us to predict the rel...
151
click to vote
CLUSTER
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
134
click to vote
ROBVIS
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents a wavelet-based algorithm for height from gradients. The tensor product of the third-order Daubechies’ scaling functions is used to span the solution space. ...
145
click to vote
VLSID
2003
IEEE
16 years 6 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...