Sciweavers

2035 search results - page 145 / 407
» Working memory
Sort
View
92
Voted
CG
2007
Springer
15 years 3 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
207
Voted
CIE
2011
Springer
14 years 3 months ago
Automatic Learners with Feedback Queries
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukh...
HPCA
2012
IEEE
13 years 11 months ago
Decoupled dynamic cache segmentation
The least recently used (LRU) replacement policy performs poorly in the last-level cache (LLC) because temporal locality of memory accesses is filtered by first and second level...
Samira Manabi Khan, Zhe Wang, Daniel A. Jimé...
ICA3PP
2009
Springer
15 years 8 months ago
Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network
Abstract. Practical implementations of atomically consistent read/write memory service are important building blocks for higher level applications. This is especially true when dat...
Chryssis Georgiou, Nikolas Hadjiprocopiou, Peter M...
153
Voted
PC
2007
161views Management» more  PC 2007»
15 years 2 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...