691 search results - page 40 / 139 » Non-negative graph embedding |
84
Voted
GD
2007
Springer
15 years 6 months ago
2007
Springer
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
113
click to vote
CEAS
2006
Springer
15 years 4 months ago
2006
Springer
We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual...
124
click to vote
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
110
Voted
GD
2006
Springer
15 years 4 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
93
Voted
PCI
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Graphs are useful data structures capable of efficiently representing a variety of technological and social networks. They are therefore utilized in simulation-based stud...