Sciweavers

1024 search results - page 38 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
COMPGEOM
2005
ACM
14 years 11 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
FCS
2006
14 years 11 months ago
The Representational Power of Conjunctive Normal Form
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
Thomas O'Neil, Jason Smith
EI
1998
47views more  EI 1998»
14 years 11 months ago
One-dimensional Dithering
A real-time inverse dithering system for video display can be implemented very efficiently if operations are needed on only the current scan line. To optimize overall display qual...
Robert Ulichney
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
14 years 10 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
CGF
2000
81views more  CGF 2000»
14 years 9 months ago
Generating Consistent Motion Transition via Decoupled Framespace Interpolation
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
Golam Ashraf, Kok Cheong Wong