Sciweavers

537 search results - page 34 / 108
» Methods for Evolving Robust Programs
Sort
View
130
Voted
CGF
2010
218views more  CGF 2010»
15 years 2 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
ATMOS
2007
114views Optimization» more  ATMOS 2007»
15 years 3 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...
BMCBI
2006
123views more  BMCBI 2006»
15 years 2 months ago
An Automated Method for Rapid Identification of Putative Gene Family Members in Plants
Background: Gene duplication events have played a significant role in genome evolution, particularly in plants. Exhaustive searches for all members of a known gene family as well ...
Ronald L. Frank, Ajay Mane, Fikret Erçal
MICCAI
2002
Springer
16 years 3 months ago
Robust Registration of Multi-modal Images: Towards Real-Time Clinical Applications
Abstract. High performance computing has become a key step to introduce computer tools, like real-time registration, in the medical field. To achieve real-time processing, one usua...
Radu Stefanescu, Sébastien Ourselin, Xavier...
121
Voted
ICASSP
2010
IEEE
15 years 2 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...