335 search results - page 30 / 67 » How to Use Spanning Trees to Navigate in Graphs |
162
click to vote
UAI
2003
15 years 7 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
191
click to vote
WADS
2007
Springer
16 years 8 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
158
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
193
click to vote
ACL
2009
15 years 4 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
138
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This work presents an H2 performance analysis of the agreement protocol in the presence of noise. The agreement protocol is first transformed into an equivalent system induced...