Sciweavers

8695 search results - page 402 / 1739
» Making the Complex Simple
Sort
View
COLT
2005
Springer
16 years 1 months ago
Analysis of Perceptron-Based Active Learning
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
Sanjoy Dasgupta, Adam Tauman Kalai, Claire Montele...
GECCO
2005
Springer
16 years 1 months ago
A new approach to evaluate GP schema in context
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
Hammad Majeed
MYCRYPT
2005
Springer
187views Cryptology» more  MYCRYPT 2005»
16 years 1 months ago
Distinguishing Attacks on T-Functions
Klimov and Shamir proposed a new class of simple cryptographic primitives named T-functions. For two concrete proposals based on the squaring operation, a single word T-function an...
Simon Künzli 0002, Pascal Junod, Willi Meier
190
Voted
AIMSA
2004
Springer
16 years 1 months ago
Planning and Monitoring Web Service Composition
The ability to automatically compose web services, and to monitor their execution, is an essential step to substantially decrease time and costs in the development, integration, a...
Marco Pistore, Fabio Barbon, Piergiorgio Bertoli, ...
ICA
2004
Springer
16 years 29 days ago
Blind Deconvolution of SISO Systems with Binary Source Based on Recursive Channel Shortening
We treat the problem of Blind Deconvolution of Single Input - Single Output (SISO) systems with real or complex binary sources. We explicate the basic mathematical idea by focusing...
Konstantinos I. Diamantaras, Theophilos Papadimitr...