Sciweavers

ML
2000
ACM
149views Machine Learning» more  ML 2000»
13 years 9 months ago
BoosTexter: A Boosting-based System for Text Categorization
This work focuses on algorithms which learn from examples to perform multiclass text and speech categorization tasks. Our approach is based on a new and improved family of boosting...
Robert E. Schapire, Yoram Singer
ML
2000
ACM
185views Machine Learning» more  ML 2000»
13 years 9 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih
JCO
2000
116views more  JCO 2000»
13 years 9 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
JCB
2000
105views more  JCB 2000»
13 years 9 months ago
A Greedy Algorithm for Aligning DNA Sequences
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
Zheng Zhang 0004, Scott Schwartz, Lukas Wagner, We...
JAR
2000
90views more  JAR 2000»
13 years 9 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
JAR
2000
123views more  JAR 2000»
13 years 9 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
JACM
2000
119views more  JACM 2000»
13 years 9 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
IWC
2000
99views more  IWC 2000»
13 years 9 months ago
Effective information visualisation: a study of graph drawing aesthetics and algorithms
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
Helen C. Purchase
INFORMATICALT
2000
160views more  INFORMATICALT 2000»
13 years 9 months ago
An Algorithm for Transformation of Finite Automata to Regular Expressions
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
Larisa Stanevichene, Aleksei Vylitok
IJON
2000
105views more  IJON 2000»
13 years 9 months ago
G-Prop: Global optimization of multilayer perceptrons using GAs
A general problem in model selection is to obtain the right parameters that make a model "t observed data. For a multilayer perceptron (MLP) trained with back-propagation (BP...
Pedro A. Castillo Valdivieso, Juan J. Merelo Guerv...