Sciweavers

582 search results - page 114 / 117
» What Will Probably Happen
Sort
View
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 9 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
COLING
1996
13 years 9 months ago
Interpretation of Nominal Compounds: Combining Domain-Independent and Domain-Specific Information
A domain independent model is proposed for the automated interpretation of nominal compounds in English. This model is meant to account for productive rules of interpretation whic...
Cécile Fabre
NIPS
1990
13 years 9 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
13 years 9 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
BMCBI
2008
136views more  BMCBI 2008»
13 years 8 months ago
Allowing for mandatory covariates in boosting estimation of sparse high-dimensional survival models
Background: When predictive survival models are built from high-dimensional data, there are often additional covariates, such as clinical scores, that by all means have to be incl...
Harald Binder, Martin Schumacher