3360 search results - page 131 / 672 » Opportunistic Data Structures with Applications |
118
Voted
JEA
2008
15 years 3 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
152
Voted
PLDI
2012
ACM
13 years 6 months ago
2012
ACM
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
162
Voted
CASES
2007
ACM
15 years 5 months ago
2007
ACM
Aggressive compiler optimizations such as software pipelining and loop invariant code motion can significantly improve application performance, but these transformations often re...
131
Voted
WWW
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we present Triplify ? a simplistic but effective approach to publish Linked Data from relational databases. Triplify is based on mapping HTTP-URI requests onto relat...
135
Voted
CVPR
1997
IEEE
16 years 5 months ago
1997
IEEE
A novel method for representing 3-D objects that unifies viewer and model centered object representations is presented. A unified 3-D frequency-domain representation (called Volum...