4039 search results - page 429 / 808 » A Method for Dynamic Clustering of Data |
172
click to vote
EUROPAR
2004
Springer
16 years 6 days ago
2004
Springer
The parallel realization of adaptive finite element methods (FEM) has to deal with several irregular and dynamic algorithmic properties caused by adaptive mesh refinement (AMR). ...
214
click to vote
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
211
click to vote
ICDT
2001
ACM
15 years 11 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
196
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...
192
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper investigates the design of a system for recognizing
objects in 3D point clouds of urban environments.
The system is decomposed into four steps: locating, segmenting,
...