3368 search results - page 544 / 674 » GRID Computing |
107
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We significantly improve the computational efficiency of a probabilistic approach for multiple pitch tracking. This method is based on a factorial hidden Markov model and two al...
230
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
135
Voted
SMA
2003
ACM
15 years 7 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
154
Voted
JAC
2008
15 years 3 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
118
Voted
ICDM
2003
IEEE
15 years 7 months ago
2003
IEEE
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...