65 search results - page 9 / 13 » Two Polynomial Time Algorithms for the Metro-line Crossing M... |
184
click to vote
JMLR
2012
13 years 6 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
131
click to vote
JSC
2010
15 years 2 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
149
click to vote
IPL
2007
15 years 4 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
131
click to vote
TCAD
2002
15 years 4 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
172
click to vote
FPL
2008
Springer
15 years 5 months ago
2008
Springer
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...