Sciweavers

18209 search results - page 3590 / 3642
» Some Remarks on the Paper
Sort
View
SIAMIS
2010
147views more  SIAMIS 2010»
14 years 10 months ago
Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
In image processing, the Rudin-Osher-Fatemi (ROF) model [L. Rudin, S. Osher, and E. Fatemi, Physica D, 60(1992), pp. 259–268] based on total variation (TV) minimization has prove...
Chunlin Wu, Xue-Cheng Tai
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
14 years 10 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
SSPR
2010
Springer
14 years 10 months ago
Information Theoretical Kernels for Generative Embeddings Based on Hidden Markov Models
Many approaches to learning classifiers for structured objects (e.g., shapes) use generative models in a Bayesian framework. However, state-of-the-art classifiers for vectorial d...
André F. T. Martins, Manuele Bicego, Vittor...
SYNTHESE
2010
70views more  SYNTHESE 2010»
14 years 10 months ago
What ought probably means, and why you can't detach it
: Some intuitive normative principles raise vexing „detaching problems‟ by their failure to license modus ponens. I examine three such principles (a self-reliance principle and...
Stephen Finlay
TCS
2010
14 years 10 months ago
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
Katerina Asdre, Stavros D. Nikolopoulos
« Prev « First page 3590 / 3642 Last » Next »