392 search results - page 5 / 79 » Modular Competitiveness for Distributed Algorithms |
IFIP12
2008
13 years 8 months ago
2008
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
PODC
1987
ACM
13 years 10 months ago
1987
ACM
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...
PPSN
2000
Springer
13 years 10 months ago
2000
Springer
In this paper, we propose a competitive image segmentation algorithm. It is a dynamic evolving optimization method, which we call the population algorithm. The method is inspired f...
ARCS
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We present a GUI-based C++ toolbox that allows for building distributed, multi-modal context recognition systems by plugging together reusable, parameterizable components...
ICA3PP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...