We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
The lack of standards for Romanization of Thai proper names makes searching activity a challenging task. This is particularly important when searching for people-related documents ...
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...