Sciweavers

9659 search results - page 1742 / 1932
» Points on Computable Curves
Sort
View
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 6 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
TVCG
2008
124views more  TVCG 2008»
15 years 6 months ago
Effective visualization of complex vascular structures using a non-parametric vessel detection method
The effective visualization of vascular structures is critical for diagnosis, surgical planning as well as treatment evaluation. In recent work, we have developed an algorithm for ...
Alark Joshi, Xiaoning Qian, Donald P. Dione, Ketan...
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 6 months ago
Unsupervised Learning of Morphology without Morphemes
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
Sylvain Neuvel, Sean A. Fulop
PVLDB
2010
167views more  PVLDB 2010»
15 years 4 months ago
Runtime Measurements in the Cloud: Observing, Analyzing, and Reducing Variance
One of the main reasons why cloud computing has gained so much popularity is due to its ease of use and its ability to scale computing resources on demand. As a result, users can ...
Jörg Schad, Jens Dittrich, Jorge-Arnulfo Quia...
TALG
2010
86views more  TALG 2010»
15 years 4 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
« Prev « First page 1742 / 1932 Last » Next »