1092 search results - page 10 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
ASAP
2007
IEEE
15 years 6 months ago
2007
IEEE
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
ALT
2002
Springer
15 years 8 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
102
click to vote
JMLR
2006
14 years 11 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
118
click to vote
TRIER
2002
14 years 11 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...