335 search results - page 46 / 67 » How to Use Spanning Trees to Navigate in Graphs |
176
click to vote
CAV
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
242
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
164
click to vote
DMDW
2001
15 years 7 months ago
2001
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
179
click to vote
NIPS
2001
15 years 7 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
159
click to vote
GRAPHICSINTERFACE
2007
15 years 7 months ago
2007
Many visualizations use smoothly animated transitions to help the user interact with information structures. These transitions are intended to preserve perceptual constancy during...