Sciweavers

339 search results - page 44 / 68
» Universality Results for Models in Locally Boolean Domains
Sort
View
FOSSACS
2000
Springer
14 years 8 days ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin
BMCBI
2010
123views more  BMCBI 2010»
13 years 3 months ago
Predicting conserved protein motifs with Sub-HMMs
Background: Profile HMMs (hidden Markov models) provide effective methods for modeling the conserved regions of protein families. A limitation of the resulting domain models is th...
Kevin Horan, Christian R. Shelton, Thomas Girke
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
14 years 2 months ago
Combining competent crossover and mutation operators: a probabilistic model building approach
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
Cláudio F. Lima, Kumara Sastry, David E. Go...
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
13 years 6 months ago
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
Daniel Munoz, Nicolas Vandapel, Martial Hebert
ICVGIP
2004
13 years 10 months ago
On Learning Shapes from Shades
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
Subhajit Sanyal, Mayank Bansal, Subhashis Banerjee...