Sciweavers

5624 search results - page 324 / 1125
» On Conditional Covering Problem
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
ECCV
2002
Springer
16 years 8 months ago
A New Image Registration Technique with Free Boundary Constraints: Application to Mammography
In this paper, a new image-matching mathematical model is presented for the mammogram registration. In a variational framework, an energy minimization problem is formulated and a m...
Frédéric J. P. Richard, Laurent D. C...
ICIP
2009
IEEE
16 years 7 months ago
Super-resolution With Continuous Scan Shift
Super-resolution methods aimed to restore the spectrum of an original image above the half sampling frequency. The restoration problem is generally viewed as an inverse problem an...
ICCAD
2003
IEEE
111views Hardware» more  ICCAD 2003»
16 years 3 months ago
Formal Methods for Dynamic Power Management
Dynamic Power Management or DPM refers to the problem of judicious application of various low power techniques based on runtime conditions in an embedded system to minimize the to...
Rajesh K. Gupta, Sandy Irani, Sandeep K. Shukla
164
Voted
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
16 years 1 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...