Sciweavers

2916 search results - page 443 / 584
» Generating Rule Sets from Model Trees
Sort
View
NECO
2000
88views more  NECO 2000»
15 years 4 months ago
Practical Identifiability of Finite Mixtures of Multivariate Bernoulli Distributions
The class of finite mixtures of multivariate Bernoulli distributions is known to be nonidentifiable, i.e., different values of the mixture parameters can correspond to exactly the...
Miguel Á. Carreira-Perpiñán, ...
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
15 years 8 months ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
15 years 6 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...
JMLR
2010
97views more  JMLR 2010»
14 years 11 months ago
Evaluation of a Bayesian model-based approach in GA studies
In a typical Genetic Association Study (GAS) several hundreds to millions of genomic variables are measured and tested for association with a given set of a phenotypic variables (...
Gábor Hullám, Peter Antal, Csaba Sza...
142
Voted
WOLLIC
2007
Springer
15 years 10 months ago
Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
Michael Moortgat