Sciweavers

436 search results - page 76 / 88
» Recursion and Complexity
Sort
View
ACL
1997
13 years 10 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
BMCBI
2010
170views more  BMCBI 2010»
13 years 9 months ago
Analysis of lifestyle and metabolic predictors of visceral obesity with Bayesian Networks
Background: The aim of this study was to provide a framework for the analysis of visceral obesity and its determinants in women, where complex inter-relationships are observed amo...
Alex Aussem, André Tchernof, Sergio Rodrigu...
ICCV
2011
IEEE
12 years 9 months ago
Articulated Part-based Model for Joint Object Detection and Pose Estimation
Despite recent successes, pose estimators are still somewhat fragile, and they frequently rely on a precise knowledge of the location of the object. Unfortunately, articulated obj...
Min Sun, Silvio Savarese
VISUALIZATION
1994
IEEE
14 years 1 months ago
A Lattice Model for Data Display
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
ICFP
2005
ACM
14 years 9 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells