11231 search results - page 95 / 2247 » Digging for Data Structures |
121
click to vote
TALG
2008
14 years 11 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
112
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
DKE
1998
14 years 11 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...
SLIP
2009
ACM
15 years 5 months ago
2009
ACM
New technologies such as 3D integration are becoming a new force that is keeping Moore’s law in effect in today’s nano era. By adding a third dimension in current 2D circuits...
ISCA
1993
IEEE
15 years 3 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...