Sciweavers

4047 search results - page 47 / 810
» The Discrete Basis Problem
Sort
View
EMMCVPR
2011
Springer
12 years 9 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
14 years 4 months ago
Reoptimization of the Shortest Common Superstring Problem
Davide Bilò, Hans-Joachim Böckenhauer,...
JMLR
2010
146views more  JMLR 2010»
13 years 4 months ago
Nonparametric Tree Graphical Models
We introduce a nonparametric representation for graphical model on trees which expresses marginals as Hilbert space embeddings and conditionals as embedding operators. This formul...
Le Song, Arthur Gretton, Carlos Guestrin
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
14 years 3 months ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
CVPR
2005
IEEE
13 years 11 months ago
Face Synthesis and Recognition from a Single Image under Arbitrary Unknown Lighting Using a Spherical Harmonic Basis Morphable M
Understanding and modifying the effects of arbitrary illumination on human faces in a realistic manner is a challenging problem both for face synthesis and recognition. Recent res...
Lei Zhang 0002, Sen Wang, Dimitris Samaras