11211 search results - page 361 / 2243 » Rank-Sensitive Data Structures |
146
click to vote
CGF
2002
15 years 6 months ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
172
click to vote
ML
2010
ACM
15 years 5 months ago
2010
ACM
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
220
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
206
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
210
click to vote
ILP
1999
Springer
15 years 11 months ago
1999
Springer
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...