6045 search results - page 279 / 1209 » Computable Linearizations of Well-partial-orderings |
144
click to vote
NA
2006
15 years 7 months ago
2006
Truncated singular value decomposition is a popular solution method for linear discrete ill-posed problems. However, since the singular value decomposition of the matrix is indepen...
188
click to vote
DAC
2010
ACM
15 years 8 months ago
2010
ACM
Vectorless power grid verification makes it possible to evaluate worst-case voltage drops without enumerating possible current waveforms. Under linear current constraints, the vec...
204
click to vote
JMLR
2006
15 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
197
click to vote
AMAST
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
196
click to vote
BIRTHDAY
2008
Springer
15 years 9 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...