Sciweavers

478 search results - page 48 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
ICDE
2004
IEEE
90views Database» more  ICDE 2004»
14 years 11 months ago
Multiresolution Indexing of XML for Frequent Queries
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
Hao He, Jun Yang 0001
ACL
2009
13 years 7 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
ICML
2004
IEEE
14 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
LREC
2010
220views Education» more  LREC 2010»
13 years 11 months ago
An Unsupervised Approach for Semantic Relation Interpretation
In this work we propose a hybrid unsupervised approach for semantic relation extraction from Italian and English texts. The system takes as input pairs of "distributionally s...
Emiliano Giovannetti