Sciweavers

6365 search results - page 275 / 1273
» Fast Local Computation Algorithms
Sort
View
SIGGRAPH
2003
ACM
15 years 12 months ago
Fast texture synthesis on arbitrary meshes
While texture synthesis on surfaces has received much attention in computer graphics, the ideal solution that quickly produces high-quality textures with little user intervention ...
Sebastian Magda, David J. Kriegman
SMA
1999
ACM
152views Solid Modeling» more  SMA 1999»
15 years 11 months ago
Fast volume-preserving free form deformation using multi-level optimization
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
Gentaro Hirota, Renee Maheshwari, Ming C. Lin
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 11 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
ICCV
1998
IEEE
16 years 8 months ago
Depth Discontinuities by Pixel-to-Pixel Stereo
Proceedings of the 1998IEEE International Conference on Computer Vision, Bombay, India An algorithm to detect depth discontinuities from a stereo pair of images is presented. The ...
Stan Birchfield, Carlo Tomasi
LSGRID
2004
Springer
16 years 9 hour ago
Mega Process Genetic Algorithm Using Grid MP
In this study, a new Genetic Algorithm (GA) using the Tabu · Local Search mechanism is proposed. The GA described in this paper is considered a Mega Process GA, which has an effe...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki,...