20573 search results - page 178 / 4115 » The Computer's New Clothes |
145
click to vote
CSCLP
2004
Springer
15 years 9 months ago
2004
Springer
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge deco...
136
click to vote
CSREASAM
2006
15 years 5 months ago
2006
Multicast Security is one of the important problems to solve for the successful deployment of group communication applications, and source authentication of multicast data is a key...
132
click to vote
ESANN
2000
15 years 5 months ago
2000
The problem of model selection is considerably important for acquiring higher levels of generalization capability in supervised learning. In this paper, we propose a new criterion ...
137
click to vote
AAECC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
134
click to vote
AMC
2006
15 years 4 months ago
2006
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...