709 search results - page 112 / 142 » On LR(k)-Parsers of Polynomial Size |
DIS
2008
Springer
14 years 11 months ago
2008
Springer
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
NIPS
2008
14 years 11 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
ACID
2006
14 years 11 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...