Sciweavers

4328 search results - page 268 / 866
» A New Kind of Science
Sort
View
COLT
1999
Springer
15 years 11 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
BMCBI
2007
181views more  BMCBI 2007»
15 years 7 months ago
ASMPKS: an analysis system for modular polyketide synthases
Background: Polyketides are secondary metabolites of microorganisms with diverse biological activities, including pharmacological functions such as antibiotic, antitumor and agroc...
Hongseok Tae, Eun-Bae Kong, Kiejung Park
ALMOB
2006
89views more  ALMOB 2006»
15 years 6 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
BMCBI
2006
94views more  BMCBI 2006»
15 years 6 months ago
Simulation of microarray data with realistic characteristics
Background: Microarray technologies have become common tools in biological research. As a result, a need for effective computational methods for data analysis has emerged. Numerou...
Matti Nykter, Tommi Aho, Miika Ahdesmäki, Pek...
TCS
2002
15 years 6 months ago
Authentication tests and the structure of bundles
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
Joshua D. Guttman, F. Javier Thayer