Sciweavers

1099 search results - page 102 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
14 years 11 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
ICCV
2011
IEEE
14 years 4 months ago
Simultaneous Correspondence and Non-Rigid 3D Reconstruction of the Coronary Tree from Single X-ray Images
We present a novel approach to simultaneously reconstruct the 3D structure of a non-rigid coronary tree and estimate point correspondences between an input X-ray image and a refer...
Eduard Serradell (Institut de Robotica i Informati...
MIG
2009
Springer
15 years 11 months ago
Evolved Controllers for Simulated Locomotion
Abstract. We present a system for automatically evolving neural networks as physics-based locomotion controllers for humanoid characters. Our approach provides two key features: (a...
Brian F. Allen, Petros Faloutsos
FC
2007
Springer
125views Cryptology» more  FC 2007»
15 years 10 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
AAAI
2008
15 years 6 months ago
Latent Tree Models and Approximate Inference in Bayesian Networks
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
Yi Wang, Nevin Lianwen Zhang, Tao Chen