4255 search results - page 54 / 851 » Cover |
ORL
1998
13 years 9 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
IPL
2011
13 years 4 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
ICIP
2006
IEEE
14 years 11 months ago
2006
IEEE
The primary goal of image steganography techniques has been to maximize embedding rate while minimizing the detectability of the resulting stego images against steganalysis techni...
DAC
2009
ACM
14 years 11 months ago
2009
ACM
Functional validation of a processor design through execution of a suite of test programs is common industrial practice. In this paper, we develop a high-level architectural speci...
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...