Sciweavers

384 search results - page 43 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
ACL
2006
13 years 9 months ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
DFG
2009
Springer
14 years 2 months ago
Group-Level Analysis and Visualization of Social Networks
Social network analysis investigates the structure of relations amongst social actors. A general approach to detect patterns of interaction and to filter out irregularities is to ...
Michael Baur, Ulrik Brandes, Jürgen Lerner, D...
MFCS
2007
Springer
14 years 1 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant
BIRTHDAY
2000
Springer
14 years 2 days ago
Bistructures, bidomains, and linear logic
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
Pierre-Louis Curien, Gordon D. Plotkin, Glynn Wins...
ACL
2011
12 years 11 months ago
A Bayesian Model for Unsupervised Semantic Parsing
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...
Ivan Titov, Alexandre Klementiev