526 search results - page 53 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
PPDP
2010
Springer
14 years 8 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
175
click to vote
ACCV
2010
Springer
15 years 4 days ago
2010
Springer
Most high dynamic range image (HDRI) algorithms assume stationary scene for registering multiple images which are taken under different exposure settings. In practice, however, the...
GLVLSI
2007
IEEE
15 years 4 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
PLDI
1997
ACM
15 years 1 months ago
1997
ACM
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...