ACL
1992
14 years 18 days ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
NIPS
2000
14 years 23 days ago
2000
An active set strategy is applied to the dual of a simple reformulation of the standard quadratic program of a linear support vector machine. This application generates a fast new...
NIPS
2003
14 years 24 days ago
2003
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
DAGSTUHL
2004
14 years 25 days ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
UAI
2008
14 years 26 days ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
UAI
2008
14 years 26 days ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
NIPS
2008
14 years 26 days ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
CAV
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...
SOFSEM
2000
Springer
14 years 3 months ago
2000
Springer
Abstract. Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gau
CSL
2006
Springer
14 years 3 months ago
2006
Springer
Abstract. The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension ...