11211 search results - page 2154 / 2243 » Data Structures |
144
Voted
EGH
2010
Springer
15 years 16 days 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...
199
click to vote
FOCS
2010
IEEE
15 years 16 days ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
130
click to vote
SSDBM
2010
IEEE
15 years 12 days ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
116
click to vote
ANCS
2009
ACM
15 years 11 days ago
2009
ACM
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
129
Voted
ICFEM
2009
Springer
15 years 8 days ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...