Sciweavers

7129 search results - page 350 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICCV
1999
IEEE
16 years 6 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
16 years 5 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 8 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
AUTOMATICA
2006
67views more  AUTOMATICA 2006»
15 years 4 months ago
Numerical methods for controlled regime-switching diffusions and regime-switching jump diffusions
This work is concerned with numerical methods for controlled regime-switching diffusions, and regime-switching jump diffusions. Numerical procedures based on Markov chain approxim...
Q. S. Song, Gang George Yin, Z. Zhang
JC
2000
45views more  JC 2000»
15 years 4 months ago
What Is the Complexity of Stieltjes Integration?
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
Arthur G. Werschulz