4860 search results - page 508 / 972 » SNPs Problems, Complexity, and Algorithms |
159
click to vote
FOCS
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
128
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
In the present paper, we address the problem of recovering the true underlying model of a surface while performing the segmentation. A novel criterion for surface (model) selection...
124
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
167
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
125
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...