Sciweavers

420 search results - page 38 / 84
» Computational Study of Fast Methods For The Eikonal Equation
Sort
View
CVPR
2009
IEEE
16 years 7 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
116
Voted
ISVC
2009
Springer
15 years 7 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
206
Voted

Presentation
2175views
17 years 1 months ago
Robust Robotic Path Planning Using Level Sets
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surround...
M. Sabry Hassouna
WABI
2009
Springer
109views Bioinformatics» more  WABI 2009»
15 years 7 months ago
Fast Prediction of RNA-RNA Interaction
Regulatory antisense RNAs are a class of ncRNAs that regulate gene expression by prohibiting the translation of an mRNA by establishing stable interactions with a target sequence. ...
Raheleh Salari, Rolf Backofen, Süleyman Cenk ...
111
Voted
BMCBI
2010
146views more  BMCBI 2010»
15 years 20 days ago
Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
Ross K. Shepherd, Theo H. E. Meuwissen, John A. Wo...