Sciweavers

20441 search results - page 3731 / 4089
» Locally Computable Structures
Sort
View
BILDMED
2007
108views Algorithms» more  BILDMED 2007»
15 years 5 months ago
Fast Interactive Region of Interest Selection for Volume Visualization
Abstract. We describe a new method to support the segmentation of a volumetric MRI- or CT-dataset such that only the components selected by the user are displayed by a volume rende...
Dominik Sibbing, Leif Kobbelt
DAGSTUHL
2010
15 years 5 months ago
Model-Based Visualization for Intervention Planning
Computer support for intervention planning is a two-stage process: In a first stage, the relevant segmentation target structures are identified and delineated. In a second stage, ...
Bernhard Preim
CSC
2008
15 years 5 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger
LREC
2010
166views Education» more  LREC 2010»
15 years 5 months ago
Learning Based Java for Rapid Development of NLP Systems
Today's natural language processing systems are growing more complex with the need to incorporate a wider range of language resources and more sophisticated statistical metho...
Nick Rizzolo, Dan Roth
LREC
2010
173views Education» more  LREC 2010»
15 years 5 months ago
Heterogeneous Data Sources for Signed Language Analysis and Synthesis: The SignCom Project
This paper describes how heterogeneous data sources captured in the SignCom project may be used for the analysis and synthesis of French Sign Language (LSF) utterances. The captur...
Kyle Duarte, Sylvie Gibet
« Prev « First page 3731 / 4089 Last » Next »