6719 search results - page 1193 / 1344 » A Generalization of Automatic Sequences |
141
click to vote
COLT
1999
Springer
15 years 8 months ago
1999
Springer
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...
146
click to vote
GECCO
1999
Springer
15 years 8 months ago
1999
Springer
Using the thermodynamics of DNA melting, a technique is proposed to choose a reaction temperature for the DNA computation that minimizes the potential for mishybridizations. Adlem...
190
click to vote
CPM
1998
Springer
15 years 8 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
150
click to vote
SIGGRAPH
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
138
click to vote
SIGGRAPH
1997
ACM
15 years 8 months ago
1997
ACM
This paper presents a novel approach to creating full view panoramic mosaics from image sequences. Unlike current panoramic stitching methods, which usually require pure horizonta...