553 search results - page 38 / 111 » Learning Meets Verification |
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
Restricted Boltzmann machines were developed using binary stochastic hidden units. These can be generalized by replacing each binary unit by an infinite number of copies that all ...
AAAI
2008
14 years 10 days ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
AVBPA
2005
Springer
14 years 3 months ago
2005
Springer
For Pen-input on-line signature verification algorithms, the influence of intersession variability is a considerable problem because hand-written signatures change with time, causi...
CP
2006
Springer
14 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
DAGSTUHL
2006
13 years 11 months ago
2006
A successful detection and classification system must have two properties: it should be general enough to compensate for intra-class variability and it should be specific enough to...