Sciweavers

1099 search results - page 211 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
RECOMB
2006
Springer
15 years 10 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
CVPR
2010
IEEE
15 years 5 months ago
Piecewise Planar and Non-Planar Stereo for Urban Scene Reconstruction
Piecewise planar models for stereo have recently become popular for modeling indoor and urban outdoor scenes. The strong planarity assumption overcomes the challenges presented by...
David Gallup, Jan-Michael Frahm, Marc Pollefeys
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
INFOCOM
2008
IEEE
15 years 4 months ago
Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
Lei Ying, Zhen Liu, Donald F. Towsley, Cathy H. Xi...
CVPR
2010
IEEE
15 years 3 months ago
Latent Hierarchical Structural Learning for Object Detection
We present a latent hierarchical structural learning method for object detection. An object is represented by a mixture of hierarchical tree models where the nodes represent objec...
Leo Zhu, Yuanhao Chen, Antonio Torralba, Alan Yuil...