Sciweavers

1696 search results - page 62 / 340
» Permuted function matching
Sort
View
APL
1998
ACM
15 years 2 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
COLT
2006
Springer
15 years 1 months ago
Stable Transductive Learning
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...
Ran El-Yaniv, Dmitry Pechyony
ICMLA
2008
14 years 11 months ago
Target Selection: A New Learning Paradigm and Its Application to Genetic Association Studies
In this work, a new learning paradigm called target selection is proposed, which can be used to test for associations between a single genetic variable and a multidimensional, qua...
Johannes Mohr, Sambu Seo, Imke Puis, Andreas Heinz...
70
Voted
CORR
2008
Springer
111views Education» more  CORR 2008»
14 years 10 months ago
New Bounds for the Capacity Region of the Finite-State Multiple Access Channel
The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered....
Haim H. Permuter, Tsachy Weissman, Jun Chen
JAL
2002
69views more  JAL 2002»
14 years 9 months ago
Rates of convergence for Quicksort
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
Ralph Neininger, Ludger Rüschendorf