Sciweavers

53 search results - page 7 / 11
» What Is the Complexity of Volume Calculation
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
13 years 7 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
ISVC
2009
Springer
14 years 1 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
MICCAI
2001
Springer
13 years 11 months ago
Shape versus Size: Improved Understanding of the Morphology of Brain Structures
Standard practice in quantitative structural neuroimaging is a segmentation into brain tissue, subcortical structures, fluid space and lesions followed by volume calculations of gr...
Guido Gerig, Martin Styner, Martha Elizabeth Shent...

Book
5690views
15 years 5 months ago
The OpenGL Reference Manual - The Bluebook
"This manual is designed to be used as the companion reference volume to the OpenGL Programming Guide by Jackie Neider, Tom Davis, and Mason Woo (Reading, MA: Addison-Wesley P...
Dave Shreiner
SSDBM
2000
IEEE
128views Database» more  SSDBM 2000»
13 years 11 months ago
Supporting Content-Based Searches on Time Series via Approximation
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
Changzhou Wang, Xiaoyang Sean Wang