Sciweavers

2149 search results - page 134 / 430
» Form over Substance
Sort
View
ACL
2007
15 years 6 months ago
Constituent Parsing with Incremental Sigmoid Belief Networks
We introduce a framework for syntactic parsing with latent variables based on a form of dynamic Sigmoid Belief Networks called Incremental Sigmoid Belief Networks. We demonstrate ...
Ivan Titov, James Henderson
ACL
2007
15 years 6 months ago
A Bayesian Model for Discovering Typological Implications
A standard form of analysis for linguistic typology is the universal implication. These implications state facts about the range of extant languages, such as “if objects come af...
Hal Daumé III, Lyle Campbell
145
Voted
AAAI
2010
15 years 6 months ago
Dominance Testing via Model Checking
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
AWPN
2008
232views Algorithms» more  AWPN 2008»
15 years 6 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
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 ...
Robin Bergenthum, Sebastian Mauser
CASCON
2007
104views Education» more  CASCON 2007»
15 years 6 months ago
Identifying fault-prone files using static analysis alerts through singular value decomposition
Static analysis tools tend to generate more alerts than a development team can reasonably examine without some form of guidance. In this paper, we propose a technique for leveragi...
Mark Sherriff, Sarah Smith Heckman, Mike Lake, Lau...