Sciweavers

2374 search results - page 86 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
CSDA
2004
124views more  CSDA 2004»
14 years 9 months ago
Fast and robust discriminant analysis
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the k...
Mia Hubert, Katrien van Driessen
EUROPAR
2007
Springer
15 years 1 months ago
Fast and Efficient Total Exchange on Two Clusters
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
Emmanuel Jeannot, Luiz Angelo Steffenel
INFOCOM
2010
IEEE
14 years 8 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
ECAL
1995
Springer
15 years 1 months ago
Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms
In this paper we investigate the phenomenon of multi-parent reproduction, i.e. we study recombination mechanisms where an arbitrary n > 1 number of parents participate in creati...
A. E. Eiben, Cees H. M. van Kemenade, Joost N. Kok
ISVC
2010
Springer
14 years 8 months ago
Robust Rigid Shape Registration Method Using a Level Set Formulation
Abstract. This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDF). The proposed algorithm aims to recover th...
Muayed S. Al-Huseiny, Sasan Mahmoodi, Mark S. Nixo...