Sciweavers

3096 search results - page 62 / 620
» The Generalized FITC Approximation
Sort
View
RECOMB
2002
Springer
14 years 9 months ago
Approximate matching of secondary structures
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
Nadia El-Mabrouk, Mathieu Raffinot
UAI
2008
13 years 10 months ago
Small Sample Inference for Generalization Error in Classification Using the CUD Bound
Confidence measures for the generalization error are crucial when small training samples are used to construct classifiers. A common approach is to estimate the generalization err...
Eric Laber, Susan Murphy
HYBRID
2000
Springer
14 years 9 days ago
Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations
A general verification algorithm is described. It is then shown how ellipsoidal methods developed by A. B. Kurzhanski and P. Varaiya can be adapted to the algorithm. New numerical ...
Oleg Botchkarev, Stavros Tripakis
JMIV
2007
98views more  JMIV 2007»
13 years 8 months ago
A Bilinear Approach to the Parameter Estimation of a General Heteroscedastic Linear System, with Application to Conic Fitting
: In this paper, we study the parameter estimation problem in a general heteroscedastic linear system, by putting the problem in the framework of the bilinear approach to low-rank ...
Pei Chen, David Suter
STACS
2009
Springer
14 years 3 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...