5607 search results - page 842 / 1122 » Graph structure in the Web |
190
click to vote
BVAI
2005
Springer
16 years 5 days ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
169
click to vote
SIGECOM
2004
ACM
16 years 4 days ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
181
click to vote
APN
2004
Springer
16 years 3 days ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
177
click to vote
ESWS
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...
183
click to vote
WLP
2004
Springer
16 years 1 days ago
2004
Springer
: The growing use of XML in commercial as well as non-commercial domains to transport information poses new challenges to concepts to access these information. Common ways to acces...