Sciweavers

1489 search results - page 81 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
GLOBECOM
2008
IEEE
15 years 4 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
CVPR
2008
IEEE
15 years 12 months ago
Particle filtering for registration of 2D and 3D point sets with stochastic dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
ICANN
2003
Springer
15 years 3 months ago
Supervised Locally Linear Embedding
Locally linear embedding (LLE) is a recently proposed method for unsupervised nonlinear dimensionality reduction. It has a number of attractive features: it does not require an ite...
Dick de Ridder, Olga Kouropteva, Oleg Okun, Matti ...
CODES
2008
IEEE
15 years 4 months ago
Speculative DMA for architecturally visible storage in instruction set extensions
Instruction set extensions (ISEs) can accelerate embedded processor performance. Many algorithms for ISE generation have shown good potential; some of them have recently been expa...
Theo Kluter, Philip Brisk, Paolo Ienne, Edoardo Ch...
MICCAI
2005
Springer
15 years 10 months ago
Automated Surface Matching Using Mutual Information Applied to Riemann Surface Structures
Many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. To avoid the need for a large set of manually-d...
Yalin Wang, Ming-Chang Chiang, Paul M. Thompson