Sciweavers

162 search results - page 26 / 33
» Structural Matching Via Optimal Basis Graphs
Sort
View
VCBM
2010
13 years 5 months ago
A General Approach to Model Biomedical Data from 3D Unorganised Point Clouds with Medial Scaffolds
We present the latest developments in modeling 3D biomedical data via the Medial Scaffold (MS), a 3D acyclic oriented graph representation of the Medial Axis (MA) [LK07, SP08]. Th...
Frederic F. Leymarie, Ming-Ching Chang, Celina Imi...
CPAIOR
2010
Springer
13 years 9 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
PLDI
2011
ACM
13 years 1 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
BIRTHDAY
2010
Springer
14 years 8 hour ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
TVCG
2008
148views more  TVCG 2008»
13 years 10 months ago
Globally Optimal Surface Mapping for Surfaces with Arbitrary Topology
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...
Xin Li, Yunfan Bao, Xiaohu Guo, Miao Jin, Xianfeng...