2570 search results - page 42 / 514 » Fast Algorithms For The Computation Of Ranklets |
DAC
1996
ACM
15 years 2 months ago
1996
ACM
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
142
click to vote
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
ACL
2012
13 years 9 days ago
2012
This paper presents a novel way of improving POS tagging on heterogeneous data. First, two separate models are trained (generalized and domain-specific) from the same data set by...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...
ISCAS
1994
IEEE
15 years 2 months ago
1994
IEEE
Based on symmetry of the maximally flat frequency response of a FIR notch filter the new design procedure is developed. The closed form solution provides direct computation of the...