32545 search results - page 436 / 6509 » Data Structures and Algorithms |
183
click to vote
DKE
1998
15 years 6 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
171
click to vote
ISCA
1993
IEEE
15 years 11 months ago
1993
IEEE
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
172
click to vote
FECS
2006
15 years 8 months ago
2006
This paper describes some of our efforts in infusing the critical thinking skill of comparing and contrasting into a course on data structures. Comparing and contrasting is the pr...
203
click to vote
MICRO
2010
IEEE
15 years 4 months ago
2010
IEEE
Advanced Synchronization Facility (ASF) is an AMD64 hardware extension for lock-free data structures and transactional memory. It provides a speculative region that atomically exec...
189
click to vote
STACS
2010
Springer
16 years 2 days ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...