Sciweavers

2570 search results - page 218 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
COMPGEOM
2003
ACM
15 years 9 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
SIGGRAPH
2010
ACM
15 years 8 months ago
A novel algorithm for incompressible flow using only a coarse grid projection
Large scale fluid simulation can be difficult using existing techniques due to the high computational cost of using large grids. We present a novel technique for simulating deta...
Michael Lentine, Wen Zheng, Ronald Fedkiw
ALMOB
2008
95views more  ALMOB 2008»
15 years 4 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
ICCV
2007
IEEE
15 years 10 months ago
Fast Automatic Heart Chamber Segmentation from 3D CT Data Using Marginal Space Learning and Steerable Features
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
Yefeng Zheng, Adrian Barbu, Bogdan Georgescu, Mich...
ANCS
2006
ACM
15 years 10 months ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...