Sciweavers

491 search results - page 80 / 99
» On cyclically orientable graphs
Sort
View
PRICAI
2004
Springer
14 years 21 days ago
Shape Matching for Robot Mapping
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for ...
Diedrich Wolter, Longin Jan Latecki
ISMB
1998
13 years 8 months ago
A Hidden Markov Model for Predicting Transmembrane Helices in Protein Sequences
A novel method to model and predict the location and orientation of alpha helices in membrane- spanning proteins is presented. It is based on a hidden Markov model (HMM) with an a...
Erik L. L. Sonnhammer, Gunnar von Heijne, Anders K...
JCT
2006
100views more  JCT 2006»
13 years 7 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
ECCC
2010
143views more  ECCC 2010»
13 years 4 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
CC
2006
Springer
122views System Software» more  CC 2006»
13 years 11 months ago
Context-Sensitive Points-to Analysis: Is It Worth It?
We present the results of an empirical study evaluating the precision of subset-based points-to analysis with several variations of context sensitivity on Java benchmarks of signif...
Ondrej Lhoták, Laurie J. Hendren