Sciweavers

4047 search results - page 302 / 810
» The Discrete Basis Problem
Sort
View
ICIP
2009
IEEE
16 years 5 months ago
A Markov Random Field Model for Extracting Near-Circular Shapes
We propose a binary Markov Random Field (MRF) model that assigns high probability to regions in the image domain consisting of an unknown number of circles of a given radius. We...
Tamas Blaskovics, Zoltan Kato, and Ian Jermyn
SODA
2010
ACM
133views Algorithms» more  SODA 2010»
16 years 4 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...
IROS
2009
IEEE
139views Robotics» more  IROS 2009»
16 years 1 months ago
Robot task switching under diminishing returns
— We investigate the problem of a robot maximizing its long-term average rate of return on work. We present a means to obtain an estimate of the instantaneous rate of return when...
Jens Wawerla, Richard T. Vaughan
ICCS
2007
Springer
16 years 24 days ago
A Generalised-Mutual-Information-Based Oracle for Hierarchical Radiosity
One of the main problems in the radiosity method is how to discretise a scene into mesh elements that allow us to accurately represent illumination. In this paper we present a new ...
Jaume Rigau, Miquel Feixas, Mateu Sbert
LSSC
2007
Springer
16 years 24 days ago
Application of Hierarchical Decomposition: Preconditioners and Error Estimates for Conforming and Nonconforming FEM
A successive refinement of a finite element grid provides a sequence of nested grids and hierarchy of nested finite element spaces as well as a natural hierarchical decompositio...
Radim Blaheta