Sciweavers

214 search results - page 40 / 43
» Generalized RBF feature maps for Efficient Detection
Sort
View
ICCV
2007
IEEE
14 years 7 months ago
Consistent Correspondence between Arbitrary Manifold Surfaces
We propose a novel framework for consistent correspondence between arbitrary manifold meshes. Different from most existing methods, our approach directly maps the connectivity of ...
Huai-yu Wu, Chunhong Pan, Qing Yang, Songde Ma

Publication
254views
12 years 11 months ago
Z-fighting aware Depth Peeling
Efficient capturing of the entire topological and geometric information of a 3D scene is an important feature in many graphics applications for rendering multi-fragment effects. Ex...
Andreas Vasilakis and Ioannis Fudos
CVPR
2001
IEEE
14 years 7 months ago
On Solving 2D and 3D Puzzles Using Curve Matching
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
Weixin Kong, Benjamin B. Kimia
ICFP
2010
ACM
13 years 6 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
ASPLOS
2008
ACM
13 years 7 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...