Sciweavers

1274 search results - page 152 / 255
» Graph lambda theories
Sort
View
NAACL
2007
13 years 10 months ago
Worst-Case Synchronous Grammar Rules
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
Daniel Gildea, Daniel Stefankovic
ACST
2006
13 years 10 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
NIPS
2001
13 years 10 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
13 years 10 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
IJCAI
1989
13 years 10 months ago
Generating Causal Explanation from a Cardio-Vascular Simulation
In this paper, we present QUALEX, a system and algorithm for generating first-order qualitative causal graphs for tutorial purposes based on de Kleer and Brown's qualitative ...
Sarah A. Douglas, Zheng-Yang Liu