Sciweavers

347 search results - page 3 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
ICGI
2010
Springer
13 years 4 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
GEM
2010
13 years 3 months ago
Revisiting Genetic Algorithms for the FPGA Placement Problem
In this work, we present a genetic algorithm framework for the FPGA placement problem. This framework is constructed based on previous proposals in this domain. We implement this f...
Peter Jamieson
SIGKDD
2000
95views more  SIGKDD 2000»
13 years 5 months ago
Scalability for Clustering Algorithms Revisited
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
Fredrik Farnstrom, James Lewis, Charles Elkan
MP
2002
84views more  MP 2002»
13 years 5 months ago
The volume algorithm revisited: relation with bundle methods
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
Laura Bahiense, Nelson Maculan, Claudia A. Sagasti...
FAW
2010
Springer
238views Algorithms» more  FAW 2010»
13 years 4 months ago
Minimum Common String Partition Revisited
Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu