361 search results - page 22 / 73 » Relaxed Gabriel Graphs |
127
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
134
Voted
NIPS
2007
15 years 3 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
116
click to vote
BIRTHDAY
2005
Springer
15 years 7 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
105
Voted
GG
2004
Springer
15 years 7 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
132
click to vote
ICDE
2012
IEEE
13 years 4 months ago
2012
IEEE
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...