6719 search results - page 365 / 1344 » A Generalization of Automatic Sequences |
117
click to vote
IANDC
2008
15 years 4 months ago
2008
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
129
click to vote
RECOMB
2002
Springer
16 years 4 months ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
110
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
109
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
106
click to vote
FOCM
2006
15 years 4 months ago
2006
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...