11211 search results - page 133 / 2243 » Rank-Sensitive Data Structures |
139
click to vote
TALG
2008
15 years 22 days 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...
135
Voted
BMCBI
2006
15 years 26 days 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...
86
Voted
SLIP
2009
ACM
15 years 7 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...
100
click to vote
ISCA
1993
IEEE
15 years 5 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...
95
Voted
FECS
2006
15 years 2 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...