Sciweavers

6365 search results - page 177 / 1273
» Fast Local Computation Algorithms
Sort
View
IJRR
2010
185views more  IJRR 2010»
15 years 3 months ago
FISST-SLAM: Finite Set Statistical Approach to Simultaneous Localization and Mapping
The solution to the problem of mapping an environment and at the same time using this map to localize (the simultaneous localization and mapping, SLAM, problem) is a key prerequis...
Bharath Kalyan, K. W. Lee, W. Sardha Wijesoma
ICS
2005
Tsinghua U.
15 years 10 months ago
Cache oblivious stencil computations
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimension...
Matteo Frigo, Volker Strumpen
APPINF
2003
15 years 6 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
133
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 5 months ago
Spatially-Adaptive Reconstruction in Computed Tomography Based on Statistical Learning
We propose a direct reconstruction algorithm for Computed Tomography, based on a local fusion of a few preliminary image estimates by means of a non-linear fusion rule. One such ru...
Joseph Shtok, Michael Zibulevsky, Michael Elad
CGI
2003
IEEE
15 years 10 months ago
Fast Volumetric Display of Natural Gaseous Phenomena
Mesh simplification algorithms play an important role in computer graphics. In particular, view-dependent simplification methods are utilized widely to reduce the geometric comp...
Stefan Röttger, Thomas Ertl