Sciweavers

AI
1999
Springer
13 years 11 months ago
Introspective Multistrategy Learning: On the Construction of Learning Strategies
A central problem in multistrategy learning systems is the selection and sequencing of machine learning algorithms for particular situations. This is typically done by the system ...
Michael T. Cox, Ashwin Ram
IJFCS
2002
58views more  IJFCS 2002»
13 years 11 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 11 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
AAECC
1999
Springer
78views Algorithms» more  AAECC 1999»
13 years 11 months ago
Properties of Finite Response Input Sequences of Recursive Convolutional Codes
Abstract. A recursive convolutional encoder can be regarded as an innite impulse response system over the Galois Field of order 2. First, in this paper, we introduce nite response ...
Didier Le Ruyet, Hong Sun, Han Vu Thien
COMCOM
1998
106views more  COMCOM 1998»
13 years 11 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
CGF
1998
128views more  CGF 1998»
13 years 11 months ago
Multiresolution Isosurface Extraction with Adaptive Skeleton Climbing
An isosurface extraction algorithm which can directly generate multiresolution isosurfacesfrom volume data is introduced. It generates low resolution isosurfaces, with 4 to 25 tim...
Tim Poston, Tien-Tsin Wong, Pheng-Ann Heng
ALGORITHMICA
1998
103views more  ALGORITHMICA 1998»
13 years 11 months ago
On Bayes Methods for On-Line Boolean Prediction
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
Nicolò Cesa-Bianchi, David P. Helmbold, San...
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
13 years 11 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher
AAECC
1998
Springer
167views Algorithms» more  AAECC 1998»
13 years 11 months ago
Generalized Bezout Identity
We describe a new approach of the generalized Bezout identity for linear time-varying ordinary differential control systems. We also explain when and how it can be extended to line...
J. F. Pommaret, Alban Quadrat