2750 search results - page 298 / 550 » The complexity of learning SUBSEQ(A) |
195
click to vote
ESANN
2006
15 years 8 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
183
click to vote
SCAI
2001
15 years 8 months ago
2001
We apply evolutionary algorithm (EA) to the design of controller for adaptive robots. EAs can be successful for more complicated tasks, where traditional engineering methods strugg...
131
click to vote
NIPS
2003
15 years 8 months ago
2003
The bootstrap has become a popular method for exploring model (structure) uncertainty. Our experiments with artificial and realworld data demonstrate that the graphs learned from...
170
click to vote
ENTCS
2006
15 years 6 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
133
click to vote
EXPERT
2006
15 years 6 months ago
2006
We argue that artificial intelligence systems must be able to manipulate their own internal representations automatically in order to deal with an infinitely complex and ever chan...