Sciweavers

3368 search results - page 544 / 674
» GRID Computing
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Efficient implementation of probabilistic multi-pitch tracking
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...
Michael Wohlmayr, Robert Peharz, Franz Pernkopf
COMPGEOM
2011
ACM
13 years 26 days ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
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...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
14 years 2 months ago
Fast swept volume approximation of complex polyhedral models
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...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
JAC
2008
13 years 10 months ago
Rule 110: universality and catenations
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...
Gaétan Richard
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
14 years 2 months ago
Association Rule Mining in Peer-to-Peer Systems
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 ...
Ran Wolff, Assaf Schuster