1201 search results - page 92 / 241 » Linear Probing and Graphs |
108
Voted
CODES
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
112
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
100
Voted
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
91
Voted
BPM
2010
Springer
15 years 2 months ago
2010
Springer
We propose a new semantics for the inclusive converging gateway (also known as Or-join). The new semantics coincides with the intuitive, widely agreed semantics for Or-joins on sou...
93
Voted
ESA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...