4843 search results - page 129 / 969 » The Shortcut Problem - Complexity and Approximation |
CVPR
2007
IEEE
16 years 6 days ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
82
Voted
BIBE
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
85
Voted
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
ECCV
2000
Springer
15 years 2 months ago
2000
Springer
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...