Sciweavers

1539 search results - page 205 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
ECCV
2010
Springer
14 years 2 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
IPPS
1998
IEEE
14 years 1 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...
AAAI
1993
13 years 10 months ago
Generating Quasi-symbolic Representation of Three-Dimensional Flow
Understanding flow in the three-dimensional phase space is challenging both to human experts and to current computer science technology. To break through the barrier, we are build...
Toyoaki Nishida
EWC
2007
102views more  EWC 2007»
13 years 9 months ago
Interactive collision detection in three-dimensional visualizations of simulated construction operations
This paper presents research that led to the design and implementation of fast and interactive collision detection methods that can be used to identify and report undesirable conï¬...
Vineet R. Kamat, Julio C. Martínez
TOG
2008
197views more  TOG 2008»
13 years 9 months ago
Two-way coupling of fluids to rigid and deformable solids and shells
We propose a novel solid/fluid coupling method that treats the coupled system in a fully implicit manner making it stable for arbitrary time steps, large density ratios, etc. In c...
Avi Robinson-Mosher, Tamar Shinar, Jon Gretarsson,...