1272 search results - page 120 / 255 » The Set Cover with Pairs Problem |
119
click to vote
ACSC
2005
IEEE
15 years 9 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
124
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
153
Voted
MEDIAFORENSICS
2010
15 years 4 months ago
2010
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...
125
click to vote
AMAI
2005
Springer
15 years 3 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
197
Voted
MMSP
2008
IEEE
15 years 9 months ago
2008
IEEE
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...