Sciweavers

849 search results - page 21 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
ECCV
2002
Springer
14 years 9 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
14 years 2 months ago
Optimal sensor hop selection: Sensor energy minimization and network lifetime maximization with guaranteed system performance
— In this paper we consider state estimation carried over a sensor network. A fusion center forms a local multi-hop tree of sensors and gateways and fuses the data into a state e...
Ling Shi, Karl Henrik Johansson, Richard M. Murray
MEDIAFORENSICS
2010
13 years 9 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
MFCS
2005
Springer
14 years 1 months ago
Complexity of DNF and Isomorphism of Monotone Formulas
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
INFOCOM
2000
IEEE
14 years 3 days ago
Wavelength Assignment in WDM Rings to Minimize SONET ADMs
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
Liwu Liu, Xiang-Yang Li, Peng-Jun Wan, Ophir Fried...