Sciweavers

10608 search results - page 374 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
69
Voted
KDD
1997
ACM
92views Data Mining» more  KDD 1997»
15 years 5 months ago
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
John M. Aronis, Foster J. Provost
91
Voted
ADVIS
2004
Springer
15 years 4 months ago
On Families of New Adaptive Compression Algorithms Suitable for Time-Varying Source Data
In this paper, we introduce a new approach to adaptive coding which utilizes Stochastic Learning-based Weak Estimation (SLWE) techniques to adaptively update the probabilities of t...
Luís G. Rueda, B. John Oommen
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 4 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
AAAI
2006
15 years 2 months ago
A Two-Step Hierarchical Algorithm for Model-Based Diagnosis
For many large systems the computational complexity of complete model-based diagnosis is prohibitive. In this paper we investigate the speedup of the diagnosis process by exploiti...
Alexander Feldman, Arjan J. C. van Gemund
NIPS
2004
15 years 2 months ago
Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments
A reactive environment is one that responds to the actions of an agent rather than evolving obliviously. In reactive environments, experts algorithms must balance exploration and ...
Daniela Pucci de Farias, Nimrod Megiddo