Sciweavers

1024 search results - page 64 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
STRINGOLOGY
2004
14 years 11 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
CORR
2006
Springer
144views Education» more  CORR 2006»
14 years 10 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
IJCV
2007
120views more  IJCV 2007»
14 years 9 months ago
Projective Visual Hulls
This article presents a novel method for computing the visual hull of a solid bounded by a smooth surface and observed by a finite set of cameras. The visual hull is the intersect...
Svetlana Lazebnik, Yasutaka Furukawa, Jean Ponce
TSMC
2002
91views more  TSMC 2002»
14 years 9 months ago
On the sure criticality of tasks in activity networks with imprecise durations
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
Stefan Chanas, Didier Dubois, Pawel Zielinski
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
14 years 8 months ago
Geodesic trajectory generation on learnt skill manifolds
Abstract— Humanoid robots are appealing due to their inherent dexterity. However, these potential benefits may only be realized if the corresponding motion synthesis procedure i...
Ioannis Havoutis, Subramanian Ramamoorthy