1688 search results - page 138 / 338 » The Complexity of Rationalizing Matchings |
154
click to vote
PKDD
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
184
click to vote
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
: This paper presents FROSTY, a computer program for automatically extracting the hierarchy of a large-scale digital CMOS circuit from its transistor-level netlist description and ...
147
click to vote
DAGM
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we present a real-time PCB inspection system which can detect defects including the breaks in the wires and short circuit. The proposed inspection algorithm is based...
148
click to vote
WACV
2002
IEEE
15 years 10 months ago
2002
IEEE
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
153
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...