6142 search results - page 363 / 1229 » The Complexity of Partition Functions |
170
click to vote
ESANN
2006
15 years 8 months ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
183
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
180
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
We provide a collision attack and preimage attacks on the MDC-2 construction, which is a method (dating back to 1988) of turning an n-bit block cipher into a 2n-bit hash function. ...
179
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
Performance of many state-of-the-art face recognition (FR) methods deteriorates rapidly, when large in size databases are considered. In this paper, we propose a novel clustering ...
275
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...