2283 search results - page 264 / 457 » Bounds of Graph Characteristics |
160
Voted
PAMI
2006
15 years 3 months ago
2006
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
150
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
133
click to vote
ICIP
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we propose a new public key watermarking scheme for reversible image authentication where if the image is authentic, the distortion due to embedding can be complete...
103
Voted
CAV
2003
Springer
15 years 8 months ago
2003
Springer
We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path that is finite, but not necessarily maximal. Truncated paths arise n...
109
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...