Sciweavers

4009 search results - page 75 / 802
» Clustering on Complex Graphs
Sort
View
EMNLP
2010
14 years 9 months ago
Word Sense Induction Disambiguation Using Hierarchical Random Graphs
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...
Ioannis P. Klapaftis, Suresh Manandhar
COCOON
2007
Springer
15 years 6 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
ESWS
2010
Springer
15 years 4 months ago
Facet Graphs: Complex Semantic Querying Made Easy
While the Semantic Web is rapidly filling up, appropriate tools for searching it are still at infancy. In this paper we describe an approach that allows humans to access informatio...
Philipp Heim, Thomas Ertl, Jürgen Ziegler
FSTTCS
1994
Springer
15 years 3 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
DAM
2008
102views more  DAM 2008»
14 years 12 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...