20441 search results - page 3614 / 4089 » Locally Computable Structures |
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
166
click to vote
EGH
2010
Springer
15 years 3 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...
171
click to vote
ICPADS
2010
IEEE
15 years 3 months ago
2010
IEEE
The MapReduce programming model simplifies large-scale data processing on commodity clusters by having users specify a map function that processes input key/value pairs to generate...
160
click to vote
SSDBM
2010
IEEE
15 years 2 months 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...
205
click to vote
ANCS
2009
ACM
15 years 2 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...