Sciweavers

691 search results - page 86 / 139
» Non-negative graph embedding
Sort
View
110
Voted
SIGIR
2006
ACM
15 years 6 months ago
Contextual search and name disambiguation in email using graphs
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
Einat Minkov, William W. Cohen, Andrew Y. Ng
98
Voted
MM
2005
ACM
134views Multimedia» more  MM 2005»
15 years 6 months ago
Graph based multi-modality learning
To better understand the content of multimedia, a lot of research efforts have been made on how to learn from multi-modal feature. In this paper, it is studied from a graph point ...
Hanghang Tong, Jingrui He, Mingjing Li, Changshui ...
115
Voted
DIAGRAMS
2004
Springer
15 years 6 months ago
Drawing Graphs in Euler Diagrams
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
Paul Mutton, Peter Rodgers, Jean Flower
108
Voted
DAC
2009
ACM
15 years 4 months ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen
119
Voted
GD
2000
Springer
15 years 4 months ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
Therese C. Biedl, Torsten Thiele, David R. Wood