Sciweavers

1024 search results - page 14 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
MFCS
2004
Springer
15 years 3 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
95
Voted
ICIP
1998
IEEE
15 years 11 months ago
Multi-Image Matching for a General Motion Stereo Camera Model
Motion stereo is to extract the 3-0 information of an object from images of a moving camera, using geometric relationships between corresponding points. This paper presents an acc...
Ja Seong Ku, Kyoung Mu Lee, Sang Uk Lee
BMVC
2002
15 years 3 days ago
Low Density Feature Point Matching for Articulated Pose Identification
We describe a general algorithm for identifying an arbitrary pose of an articulated subject with low density feature points. The algorithm aims to establish a one-to-one correspon...
Horst Holstein, Baihua Li
MOC
2002
92views more  MOC 2002»
14 years 9 months ago
Asymptotic properties of the spectral test, diaphony, and related quantities
This paper presents the limit laws of discrepancies defined via exponential sums, and algorithms (with error bounds) to approximate the corresponding distribution functions. The re...
Hannes Leeb
TCS
2008
14 years 9 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh