4983 search results - page 79 / 997 » order 2008 |
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...