927 search results - page 79 / 186 » A Data Abstraction Alternative to Data Structure Algorithm M... |
124
Voted
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
139
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
161
Voted
PAMI
2011
14 years 9 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
131
Voted
KES
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Search engines traditionally index unstructured text and return ranked lists of documents that match a given query. As search engines functionally move in the direction o...
126
Voted
PC
2007
15 years 2 months ago
2007
Abstract. In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. During the algorithm ...