112 search results - page 8 / 23 » Distributed anonymous discrete function computation |
KDD
2008
ACM
14 years 7 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
PACT
2009
Springer
14 years 1 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
CVPR
2008
IEEE
14 years 8 months ago
2008
IEEE
This paper presents a novel distributed framework for multi-target tracking with an efficient data association computation. A decentralized representation of trackers' motion...
ISBI
2008
IEEE
14 years 7 months ago
2008
IEEE
Visualization and analysis of the micro-architecture of brain parenchyma by means of magnetic resonance imaging is nowadays believed to be one of the most powerful tools used for ...
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...