Sciweavers

613 search results - page 108 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
125
Voted
SIGGRAPH
1998
ACM
15 years 6 months ago
The Clipmap: A Virtual Mipmap
We describe the clipmap, a dynamic texture representation that efficiently caches textures of arbitrarily large size in a finite amount of physical memory for rendering at real-...
Christopher C. Tanner, Christopher J. Migdal, Mich...
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
15 years 6 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
98
Voted
ARCS
2006
Springer
15 years 6 months ago
Dynamic Dictionary-Based Data Compression for Level-1 Caches
Abstract. Data cache compression is actively studied as a venue to make better use of onchip transistors, increase apparent capacity of caches, and hide the long memory latencies. ...
Georgios Keramidas, Konstantinos Aisopos, Stefanos...
CP
2006
Springer
15 years 6 months ago
Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
Michele Lombardi, Michela Milano
129
Voted
EACL
2006
ACL Anthology
15 years 4 months ago
Automatic Acronym Recognition
This paper deals with the problem of recognizing and extracting acronymdefinition pairs in Swedish medical texts. This project applies a rule-based method to solve the acronym rec...
Dana Dannélls