Sciweavers

860 search results - page 127 / 172
» Biased Random Walks
Sort
View
TCS
2010
14 years 8 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel
CVPR
2012
IEEE
13 years 5 days ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
CVPR
2006
IEEE
15 years 11 months ago
Simultaneous Registration and Modeling of Deformable Shapes
Many natural objects vary the shapes as linear combinations of certain bases. The measurement of such deformable shapes is coupling of rigid similarity transformations between the...
Jing Xiao, Bogdan Georgescu, Xiang Zhou, Dorin Com...
BMCBI
2008
114views more  BMCBI 2008»
14 years 10 months ago
Dinucleotide controlled null models for comparative RNA gene prediction
Background: Comparative prediction of RNA structures can be used to identify functional noncoding RNAs in genomic screens. It was shown recently by Babak et al. [BMC Bioinformatic...
Tanja Gesell, Stefan Washietl
TJS
2002
160views more  TJS 2002»
14 years 9 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon