287 search results - page 43 / 58 » Exact Cover with light |
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
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...
156
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
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. ...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
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,...
PAKDD
2009
ACM
15 years 4 months ago
2009
ACM
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 ...
102
click to vote
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...