Sciweavers

570 search results - page 22 / 114
» On the number of zero-sum subsequences
Sort
View
ESA
2006
Springer
108views Algorithms» more  ESA 2006»
14 years 1 months ago
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
Matthias Englert, Matthias Westermann
CBMS
2005
IEEE
13 years 11 months ago
Local Dimensionality Reduction within Natural Clusters for Medical Data Analysis
Inductive learning systems have been successfully applied in a number of medical domains. Nevertheless, the effective use of these systems requires data preprocessing before apply...
Mykola Pechenizkiy, Alexey Tsymbal, Seppo Puuronen
LWA
2007
13 years 11 months ago
Meta-Learning Rule Learning Heuristics
The goal of this paper is to investigate to what extent a rule learning heuristic can be learned from experience. Our basic approach is to learn a large number of rules and record ...
Frederik Janssen, Johannes Fürnkranz
ECIS
2001
13 years 11 months ago
Market Analysis of Electronic Business in Switzerland and Comparisons with Europe
A representative market study was carried out to determine the penetration of electronic business in Swiss companies. A random sample was used in which companies were classified b...
Andreas Meier, Stefan Hüsemann, Ambros Lü...
COMBINATORICS
2006
133views more  COMBINATORICS 2006»
13 years 10 months ago
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
Mark Lipson