2626 search results - page 116 / 526 » The complexity of stochastic sequences |
163
click to vote
ENTCS
2006
15 years 6 months ago
2006
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
240
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Life science laboratories today have to rely on procedural techniques to store and manage large sequence datasets. Procedural techniques are cumbersome to use and are often very i...
170
click to vote
ICML
2004
IEEE
15 years 11 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
155
click to vote
ICANN
2001
Springer
15 years 10 months ago
2001
Springer
This paper studies the use of discrete-time recurrent neural networks for predicting the next symbol in a sequence. The focus is on online prediction, a task much harder than the c...
180
click to vote
CAINE
2008
15 years 7 months ago
2008
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...