11231 search results - page 1735 / 2247 » Digging for Data Structures |
177
Voted
SPDP
1993
IEEE
15 years 10 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
155
click to vote
VL
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
170
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
162
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
209
click to vote
FCCM
2004
IEEE
15 years 10 months ago
2004
IEEE
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...