Sciweavers

3630 search results - page 125 / 726
» Fast Marching Methods
Sort
View
128
Voted
BMCBI
2008
102views more  BMCBI 2008»
15 years 2 months ago
Fast splice site detection using information content and feature reduction
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
CGF
2008
150views more  CGF 2008»
15 years 2 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
114
Voted
MICCAI
2010
Springer
15 years 1 months ago
Model-Free, Regularized, Fast, and Robust Analytical Orientation Distribution Function Estimation
High Angular Resolution Imaging (HARDI) can better explore the complex micro-structure of white matter compared to Diffusion Tensor Imaging (DTI). Orientation Distribution Functio...
Jian Cheng, Aurobrata Ghosh, Rachid Deriche, Tianz...
212
Voted
PVLDB
2010
220views more  PVLDB 2010»
14 years 9 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
253
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 2 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup