Sciweavers

3875 search results - page 497 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
NIPS
1990
15 years 7 months ago
Convergence of a Neural Network Classifier
In this paper, we show that the LVQ learning algorithm converges to locally asymptotic stable equilibria of an ordinary differential equation. We show that the learning algorithm ...
John S. Baras, Anthony LaVigna
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 7 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
GLOBECOM
2009
IEEE
16 years 1 months ago
Anonymous Cardinality Estimation in RFID Systems with Multiple Readers
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
Vahid Shah-Mansouri, Vincent W. S. Wong
ICPR
2008
IEEE
16 years 7 months ago
Tailoring text for automatic layouting of newspaper pages
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
Leonhard Hennig, Thomas Strecker
IWPEC
2004
Springer
16 years 19 hour ago
Packing Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Luke Mathieson, Elena Prieto, Peter Shaw