Sciweavers

1089 search results - page 49 / 218
» Randomness and Reducibility
Sort
View
VLDB
1998
ACM
132views Database» more  VLDB 1998»
14 years 1 months ago
Buffering and Read-Ahead Strategies for External Mergesort
The elapsed time for external mergesort is normally dominated by I/O time. This paper is focused on reducing I/O time during the merge phase. Three new buffering and readahead str...
Weiye Zhang, Per-Åke Larson
EPEW
2006
Springer
14 years 20 days ago
A Precedence PEPA Model for Performance and Reliability Analysis
We propose new techniques to simplify the computation of the cycle times and the absorption times for a large class of PEPA models. These techniques allow us to simplify the model ...
Jean-Michel Fourneau, Leïla Kloul
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
14 years 9 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
CEC
2003
IEEE
14 years 2 months ago
Learning DFA: evolution versus evidence driven state merging
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Simon M. Lucas, T. Jeff Reynolds
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
14 years 1 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson