Sciweavers

4894 search results - page 716 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 3 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
AUTOMATICA
2011
13 years 3 months ago
Timing and liveness in continuous Petri nets
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreove...
Carlos Renato Vázquez, Manuel Silva
JMLR
2010
367views more  JMLR 2010»
13 years 3 months ago
Locally Linear Denoising on Image Manifolds
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
Dian Gong, Fei Sha, Gérard G. Medioni
JMLR
2010
163views more  JMLR 2010»
13 years 3 months ago
Active Sequential Learning with Tactile Feedback
We consider the problem of tactile discrimination, with the goal of estimating an underlying state parameter in a sequential setting. If the data is continuous and highdimensional...
Hannes Saal, Jo-Anne Ting, Sethu Vijayakumar
MOC
2010
13 years 3 months ago
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
Ren-Cang Li