Sciweavers

2693 search results - page 23 / 539
» On Computing Complex Navigation Functions
Sort
View
CVPR
2003
IEEE
14 years 12 months ago
Visual Landmarks Detection and Recognition for Mobile Robot Navigation
This article describes visual functions dedicated to the extraction and recognition of planar quadrangles detected from a single camera. Extraction is based on a relaxation scheme...
Frédéric Lerasle, Jean-Bernard Hayet...
COMPGEOM
2003
ACM
14 years 3 months ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
BMCBI
2010
177views more  BMCBI 2010»
13 years 10 months ago
Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets
Background: Phylogenetic analysis can be used to divide a protein family into subfamilies in the absence of experimental information. Most phylogenetic analysis methods utilize mu...
Aydin Albayrak, Hasan H. Otu, Ugur O. Sezerman
JC
2011
87views more  JC 2011»
13 years 4 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
UC
2005
Springer
14 years 3 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha