1024 search results - page 62 / 205 » The Generalized PatchMatch Correspondence Algorithm |
115
click to vote
RECOMB
2009
Springer
16 years 3 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
134
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
173
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
128
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
155
click to vote
RT
1998
Springer
15 years 7 months ago
1998
Springer
Most current image-based rendering methods operate under the assumption that all of the visible surfaces in the scene are opaque ideal diffuse (Lambertian) reflectors. This paper i...