Sciweavers

1653 search results - page 195 / 331
» Directed tree-width examples
Sort
View
126
Voted
COLT
1999
Springer
15 years 7 months ago
Multiclass Learning, Boosting, and Error-Correcting Codes
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
Venkatesan Guruswami, Amit Sahai
122
Voted
CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
15 years 7 months ago
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
Radha Poovendran, John S. Baras
ECOOP
1999
Springer
15 years 7 months ago
Propagating Class and Method Combination
Abstract. This paper presents a mixin based class and method combination mechanism with block structure propagation. Traditionally, mixins can be composed to form new classes, poss...
Erik Ernst
IWCC
1999
IEEE
15 years 7 months ago
Design and Analysis of the Alliance/University of New Mexico Roadrunner Linux SMP SuperCluster
This paper will discuss high performance clustering from a series of critical topics: architectural design, system software infrastructure, and programming environment. This will ...
David A. Bader, Arthur B. Maccabe, Jason R. Mastal...
131
Voted
LICS
1999
IEEE
15 years 7 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese