Sciweavers

9842 search results - page 197 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
RANLP
2003
13 years 11 months ago
Combining independent modules in lexical multiple-choice problems
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
Peter D. Turney, Michael L. Littman, Jeffrey Bigha...
ESORICS
2010
Springer
13 years 11 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi
IPM
2002
102views more  IPM 2002»
13 years 10 months ago
Problems of music information retrieval in the real world
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...
Donald Byrd, Tim Crawford
TNN
2010
171views Management» more  TNN 2010»
13 years 5 months ago
Sensitivity versus accuracy in multiclass problems using memetic Pareto evolutionary neural networks
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high...
Juan Carlos Fernández Caballero, Francisco ...
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...