867 search results - page 90 / 174 » The Generalized Maximum Coverage Problem |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
We introduce novel discriminative learning algorithms for dynamical systems. Models such as Conditional Random Fields or Maximum Entropy Markov Models outperform the generative Hi...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
JAIR
2011
13 years 2 months ago
2011
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...