Sciweavers

2297 search results - page 38 / 460
» A fast APRIORI implementation
Sort
View
98
Voted
DC
2006
14 years 10 months ago
Fast Paxos
Abstract. Paxos and Fast Paxos are optimal consensus algorithms that are simple and elegant, while suitable for efficient implementation. In this paper, we compare the performance ...
Leslie Lamport
PAMI
2006
206views more  PAMI 2006»
14 years 10 months ago
Fast Active Appearance Model Search Using Canonical Correlation Analysis
A fast AAM search algorithm based on canonical correlation analysis (CCA-AAM) is introduced. It efficiently models the dependency between texture residuals and model parameters dur...
Rene Donner, Michael Reiter, Georg Langs, Philipp ...
GPEM
2002
163views more  GPEM 2002»
14 years 10 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
JAVA
2001
Springer
15 years 2 months ago
Runtime optimizations for a Java DSM implementation
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. Jackal implements Java’s memory model and allows multithreaded Java programs...
Ronald Veldema, Rutger F. H. Hofman, Raoul Bhoedja...
ICW
2005
IEEE
117views Communications» more  ICW 2005»
15 years 4 months ago
Implementation Issues of Managed Bandwidth Service: The Case of GRNET
This paper describes the design and the implementation of the Managed Bandwidth Service (MBS) in a high speed backbone network as well as a management tool for the service. The se...
Christos Bouras, Dimitris Primpas