Sciweavers

287 search results - page 43 / 58
» Exact Cover with light
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Competitive Mixtures of Simple Neurons
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...
CP
2009
Springer
14 years 8 months ago
Constraint-Based Graph Matching
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. ...
Christine Solnon, Vianney le Clément, Yves ...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 7 months ago
Random knapsack in expected polynomial time
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,...
René Beier, Berthold Vöcking
PAKDD
2009
ACM
112views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Romanization of Thai Proper Names Based on Popularity of Usages
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 ...
Akegapon Tangverapong, Atiwong Suchato, Proadpran ...
MFCS
2009
Springer
14 years 1 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
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 ...