3875 search results - page 488 / 775 » Approximation algorithms for the 0-extension problem |
153
click to vote
ALGORITHMS
2010
15 years 4 months ago
2010
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
221
click to vote
AAAI
2011
14 years 6 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
177
click to vote
NIPS
1998
15 years 8 months ago
1998
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
167
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Considering the statistical text classification problem we approximate class-conditional probability distributions by structurally modified Poisson mixtures. By introducing the st...
186
click to vote
WAOA
2004
Springer
16 years 13 hour ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...