5607 search results - page 749 / 1122 » Graph structure in the Web |
153
click to vote
FSTTCS
1992
Springer
15 years 11 months ago
1992
Springer
The branching bisimulation de ned by Van Glabbeek and Weijland takes care of preserving the branching structure of processes even though silent actions are taken. Branching bisimu...
153
click to vote
CEAS
2006
Springer
15 years 10 months ago
2006
Springer
We address the problem of suggesting who to add as an additional recipient (i.e. cc, or carbon copy) for an email under composition. We address the problem using graphical models ...
169
click to vote
FCT
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
186
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
154
click to vote
AAAI
2007
15 years 9 months ago
2007
We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, ...