Sciweavers

1653 search results - page 259 / 331
» Adversarial Sequence Prediction
Sort
View
AAAI
1997
15 years 7 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
DAGSTUHL
1996
15 years 7 months ago
Competitive Analysis of Distributed Algorithms
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
James Aspnes
HPDC
2010
IEEE
15 years 7 months ago
Exploring the RNA folding energy landscape using scalable distributed cyberinfrastructure
The increasing significance of RNAs in transcriptional or post-transcriptional gene regulation processes has generated considerable interest towards the prediction of RNA folding ...
Joohyun Kim, Wei Huang, Sharath Maddineni, Fareed ...
BMCBI
2008
89views more  BMCBI 2008»
15 years 6 months ago
An incremental approach to automated protein localisation
Background: The subcellular localisation of proteins in intact living cells is an important means for gaining information about protein functions. Even dynamic processes can be ca...
Marko Tscherepanow, Nickels Jensen, Franz Kummert
CANDC
2008
ACM
15 years 6 months ago
In silico identification of the protein disulfide isomerase family from a protozoan parasite
Protein disulfide isomerase (PDI) enzymes are eukaryotic oxidoreductases that catalyze the correct formation of disulfide bonds during protein folding. Structurally they are chara...
Marco A. Ramos, Rosa E. Mares, Paloma D. Maga&ntil...