2466 search results - page 257 / 494 » Algorithms for distributed functional monitoring |
190
click to vote
NIPS
1994
15 years 8 months ago
1994
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
170
click to vote
ICPP
2006
IEEE
16 years 19 days ago
2006
IEEE
— This paper presents Salsa, a novel, decentralized and asynchronous realization of the “replica exchange” algorithm for simulating the structure, function, folding, and dyna...
148
click to vote
COCOON
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
179
click to vote
CINQ
2004
Springer
16 years 10 hour ago
2004
Springer
This chapter investigates subgroup discovery as a task of constraint-based mining of local patterns, aimed at describing groups of individuals with unusual distributional character...
163
click to vote
CSDA
2007
15 years 6 months ago
2007
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...