Sciweavers

1653 search results - page 28 / 331
» Adversarial Sequence Prediction
Sort
View
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
14 years 16 days ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
TSMC
2002
102views more  TSMC 2002»
13 years 8 months ago
Modeling and analysis of air campaign resource allocation: a spatio-temporal decomposition approach
In this paper, we address the modeling and analysis issues associated with a generic theater level campaign where two adversaries pit their military resources against each other ov...
Debasish Ghose, M. Krichman, Jason L. Speyer, Jeff...
ICMLA
2007
13 years 10 months ago
Machine learned regression for abductive DNA sequencing
We construct machine learned regressors to predict the behaviour of DNA sequencing data from the fluorescent labelled Sanger method. These predictions are used to assess hypothes...
David Thornley, Maxim Zverev, Stavros Petridis
BMCBI
2010
163views more  BMCBI 2010»
13 years 3 months ago
RISCI - Repeat Induced Sequence Changes Identifier: a comprehensive, comparative genomics-based, in silico subtractive hybridiza
Background -: The availability of multiple whole genome sequences has facilitated in silico identification of fixed and polymorphic transposable elements (TE). Whereas polymorphic...
Vipin Singh, Rakesh K. Mishra
ICML
2010
IEEE
13 years 9 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...