2957 search results - page 317 / 592 » The Complexity of Polynomial-Time Approximation |
187
click to vote
SLP
1994
15 years 8 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
188
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--More and more embedded systems provide a multitude of services, implemented by a large number of networked hardware components. In early design phases, dimensioning such ...
181
click to vote
NAACL
2010
15 years 4 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
180
click to vote
SIAMNUM
2011
15 years 1 months ago
2011
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
190
click to vote
JMLR
2010
15 years 1 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...