Sciweavers

141 search results - page 24 / 29
» Fast probabilistic snake algorithm
Sort
View
70
Voted
ALMOB
2008
95views more  ALMOB 2008»
14 years 9 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
MICCAI
2006
Springer
15 years 10 months ago
Atlas Guided Identification of Brain Structures by Combining 3D Segmentation and SVM Classification
Abstract. This study presents a novel automatic approach for the identification of anatomical brain structures in magnetic resonance images (MRI). The method combines a fast multis...
Ayelet Akselrod-Ballin, Meirav Galun, Moshe John G...
NCA
2005
IEEE
15 years 3 months ago
Using Residual Times to Meet Deadlines in M/G/C Queues
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howar...
CODES
1999
IEEE
15 years 1 months ago
A hardware-software cosynthesis technique based on heterogeneous multiprocessor scheduling
In this paper, we propose a fast and simple heuristic for the cosynthesis problem targeting the system-on-chip (SOC) design. The proposed algorithm covers from implementation sele...
Hyunok Oh, Soonhoi Ha
CACM
2008
131views more  CACM 2008»
14 years 9 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn