Sciweavers

2695 search results - page 206 / 539
» Learning Graph Matching
Sort
View
COMPGEOM
2003
ACM
15 years 8 months ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
106
Voted
EMNLP
2007
15 years 4 months ago
Using Semantic Roles to Improve Question Answering
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
Dan Shen, Mirella Lapata
ALGORITHMICA
2010
108views more  ALGORITHMICA 2010»
15 years 3 months ago
An Efficient Algorithm for Batch Stability Testing
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
John Dabney, Brian C. Dean
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
15 years 3 months ago
Pfaffian labelings and signs of edge colorings
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Serguei Norine, Robin Thomas
JMLR
2008
94views more  JMLR 2008»
15 years 3 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff