Sciweavers

477 search results - page 64 / 96
» Storing RDF as a Graph
Sort
View
ICNP
2009
IEEE
14 years 4 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 1 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
SPAA
2009
ACM
14 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
ICFP
2008
ACM
14 years 10 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
EUROGRAPHICS
2010
Eurographics
14 years 7 months ago
Real-time Rendering of Heterogeneous Translucent Objects with Arbitrary Shapes
We present a real-time algorithm for rendering translucent objects of arbitrary shapes. We approximate the scattering of light inside the objects using the diffusion equation, whi...
Yajun Wang, Jiaping Wang, Nicolas Holzschuch, Kart...