Sciweavers

17760 search results - page 317 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
COLT
2001
Springer
15 years 11 months ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
ICIP
2001
IEEE
16 years 8 months ago
N-dimensional zonal algorithms. The future of block based motion estimation?
The popularity of zonal based algorithms for block based motion estimation has been recently increasing due to their superior performance in both terms of reduced complexity and s...
Alexis M. Tourapis, Hye-Yeon Cheong, Ming L. Liou,...
FSE
1997
Springer
131views Cryptology» more  FSE 1997»
15 years 11 months ago
Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...
Bruce Schneier, Doug Whiting
CCR
2006
122views more  CCR 2006»
15 years 6 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ISNN
2010
Springer
15 years 5 months ago
Extension of the Generalization Complexity Measure to Real Valued Input Data Sets
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
Iván Gómez, Leonardo Franco, Jos&eac...