1819 search results - page 142 / 364 » Computability and Representations of the Zero Set |
FOCS
1994
IEEE
15 years 1 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
117
click to vote
AWPN
2008
14 years 11 months ago
2008
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
111
click to vote
ICSOC
2010
Springer
14 years 8 months ago
2010
Springer
Linked Data has become a popular term and method of how to expose structured data on the Web. There currently are two school of thought when it comes to defining what Linked Data ...
109
click to vote
ACL
2011
14 years 1 months ago
2011
We propose a non-parametric Bayesian model for unsupervised semantic parsing. Following Poon and Domingos (2009), we consider a semantic parsing setting where the goal is to (1) d...
ACL
2012
13 years 12 days ago
2012
Although much work on relation extraction has aimed at obtaining static facts, many of the target relations are actually fluents, as their validity is naturally anchored to a cer...