Sciweavers

1229 search results - page 212 / 246
» A New Method for Dependent Parsing
Sort
View
BMCBI
2007
105views more  BMCBI 2007»
14 years 9 months ago
Generating confidence intervals on biological networks
Background: In the analysis of networks we frequently require the statistical significance of some network statistic, such as measures of similarity for the properties of interact...
Thomas Thorne, Michael P. H. Stumpf
IOR
2006
177views more  IOR 2006»
14 years 9 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
JMLR
2008
129views more  JMLR 2008»
14 years 9 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
IJAR
2007
96views more  IJAR 2007»
14 years 9 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
INFORMATICALT
2010
107views more  INFORMATICALT 2010»
14 years 8 months ago
Optimization of Formant Feature Based Speech Recognition
The paper deals with the use of formant features in dynamic time warping based speech recognition. These features can be simply visualized and give a new insight into understanding...
Antanas Lipeika