2477 search results - page 91 / 496 » Approximate extended formulations |
165
click to vote
COMBINATORICA
2010
14 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
117
click to vote
ISBI
2004
IEEE
16 years 4 months ago
2004
IEEE
Our goal is to analyze regularized image reconstruction methods such as penalized likelihood with respect to the performance of the Channelized Hotelling Observer (CHO) in the tas...
130
click to vote
RANDOM
2001
Springer
15 years 8 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
129
click to vote
WSC
2001
15 years 5 months ago
2001
Various stochastic programmingproblemscan be formulated as problems of optimization of an expected value function. Quite often the corresponding expectation function cannot be com...
143
click to vote
APPML
2008
15 years 4 months ago
2008
The main goal of this article is to discuss a controllability approach to the image matching / shape identification problem, an important issue in many applications, medical ones ...