Sciweavers

246 search results - page 34 / 50
» Efficient Algorithms for Inverting Evolution
Sort
View
TVCG
2008
167views more  TVCG 2008»
13 years 6 months ago
Optimal Surface Parameterization Using Inverse Curvature Map
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
Yong-Liang Yang, Junho Kim, Feng Luo 0002, Shi-Min...
ICPR
2000
IEEE
14 years 8 months ago
Cooperation between Level Set Techniques and Dense 3D Registration for the Segmentation of Brain Structures
This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial ...
C. Baillard, Pierre Hellier, Christian Barillot
SPIRE
2000
Springer
13 years 11 months ago
Virtual Test Tubes: A New Methodology for Computing
Biomolecular computing (BMC) aims to capture the innumerable advantages that biological molecules have gained in the course of millions of years of evolution to perform computatio...
Max H. Garzon, Evan Drumwright, Russell J. Deaton,...
BIB
2008
141views more  BIB 2008»
13 years 7 months ago
Detecting short tandem repeats from genome data: opening the software black box
Short tandem repeats, specifically microsatellites, are widely used genetic markers, associated with human genetic diseases, and play an important role in various regulatory mecha...
Angelika Merkel, Neil Gemmell
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex