20294 search results - page 155 / 4059 » Algorithmic Information Theory |
165
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
148
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
189
click to vote
TSP
2008
15 years 4 months ago
2008
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...
117
click to vote
ACL
2001
15 years 5 months ago
2001
We offer a computational analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ...
148
click to vote
ILP
2005
Springer
15 years 10 months ago
2005
Springer
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...