6045 search results - page 917 / 1209 » Computable Linearizations of Well-partial-orderings |
206
click to vote
ESANN
2004
15 years 8 months ago
2004
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
153
Voted
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
179
click to vote
WSC
2004
15 years 8 months ago
2004
Building computational models of real world systems usually requires the interaction of decision modules and simulation modules. Given different models and algorithms, the major h...
173
click to vote
NIPS
2003
15 years 8 months ago
2003
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
185
click to vote
COLING
2000
15 years 8 months ago
2000
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...