Sciweavers

2703 search results - page 497 / 541
» Optimizing memory transactions
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 5 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
TIT
2010
90views Education» more  TIT 2010»
13 years 5 months ago
Correcting limited-magnitude errors in the rank-modulation scheme
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
Itzhak Tamo, Moshe Schwartz
CORR
2011
Springer
124views Education» more  CORR 2011»
13 years 5 months ago
Parallel Recursive State Compression for Free
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
CVPR
2011
IEEE
13 years 4 months ago
Reduced Epipolar Cost for Accelerated Incremental SfM
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
A. L. Rodriguez, P E. Lopez-de-Teruel, A. Ruiz
AI
2011
Springer
13 years 2 months ago
Parallelizing a Convergent Approximate Inference Method
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
Ming Su, Elizabeth Thompson