1115 search results - page 90 / 223 » Separating Shape Graphs |
112
Voted
WEA
2007
Springer
15 years 6 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
91
Voted
LREC
2008
15 years 2 months ago
2008
This paper presents the results of a graph-based method for performing knowledge-based Word Sense Disambiguation (WSD). The technique exploits the structural properties of the gra...
102
Voted
JMLR
2008
15 years 21 days ago
2008
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
99
Voted
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
112
Voted
CIDM
2009
IEEE
15 years 4 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...