Sciweavers

2745 search results - page 77 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
131
Voted
PDCN
2004
15 years 4 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
152
Voted
AP2PS
2009
IEEE
15 years 6 months ago
Algorithm-Based Fault Tolerance Applied to P2P Computing Networks
—P2P computing platforms are subject to a wide range of attacks. In this paper, we propose a generalisation of the previous disk-less checkpointing approach for fault-tolerance i...
Thomas Roche, Mathieu Cunche, Jean-Louis Roch
79
Voted
ICPR
2002
IEEE
16 years 4 months ago
Fast Projection Plane Classifier
In this paper a new approach for classification is presented, the "Fast Projection Plane Classfier", abbreviated here to FPPC. The main idea of FPPC is very simple: A cl...
Dirk Balthasar, Lutz Priese
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 8 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
111
Voted
EUROPAR
2007
Springer
15 years 7 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