4894 search results - page 913 / 979 » The Guarding Problem - Complexity and Approximation |
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
The problem of tracking involves challenges like in-plane and out-of-plane rotations, scaling, variations in ambient light and occlusions. In this paper we look at the problem of ...
182
click to vote
ICDE
1998
IEEE
15 years 11 months ago
1998
IEEE
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...