1425 search results - page 59 / 285 » Beyond Dependency Graphs |
111
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
147
Voted
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior ...
150
Voted
IEICET
2011
14 years 9 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
142
Voted
SIGSOFT
1994
ACM
15 years 6 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
119
Voted
JETAI
1998
15 years 2 months ago
1998
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...