958 search results - page 143 / 192 » Efficient data structures for range-aggregate queries on tre... |
ACL
2008
14 years 11 months ago
2008
This paper is concerned with the problem of question search. In question search, given a question as query, we are to return questions semantically equivalent or close to the quer...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
102
click to vote
EGH
2010
Springer
14 years 8 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
114
click to vote
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--The now commonplace multi-core chips have introduced, by design, a deep hierarchy of memory and cache banks within parallel computers as a tradeoff between the user frien...
170
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
A large number of online databases are hidden behind the web. Users to these systems can form queries through web forms to retrieve a small sample of the database. Sampling such h...