1716 search results - page 315 / 344 » Proving Conditional Termination |
ICCV
1999
IEEE
16 years 2 months ago
1999
IEEE
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
183
Voted
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
110
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
119
Voted
STOC
2009
ACM
16 years 1 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...
106
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...