Sciweavers

6719 search results - page 86 / 1344
» A Generalization of Automatic Sequences
Sort
View
BMCBI
2005
108views more  BMCBI 2005»
13 years 8 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
ISSAC
1993
Springer
119views Mathematics» more  ISSAC 1993»
14 years 28 days ago
Finding all Hypergeometric Solutions of Linear Differential Equations
Hypergeometric sequences are such that the quotient of two successive terms is a fixed rational function of the index. We give a generalization of M. Petkov6ek’s algorithm to fi...
Marko Petkovsek, Bruno Salvy
PIMRC
2008
IEEE
14 years 3 months ago
The design and detection of signature sequences in time-frequency selective channel
Abstract— In a slot-synchronized wireless communication system, a set of signature sequences can be derived by circularly shifting a base sequence with good auto correlation prop...
Jiann-Ching Guey
BIB
2006
141views more  BIB 2006»
13 years 9 months ago
Statistical significance in biological sequence analysis
One of the major goals of computational sequence analysis is to find sequence similarities, which could serve as evidence of structural and functional conservation, as well as of ...
Alexander Yu. Mitrophanov, Mark Borodovsky
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden