7150 search results - page 944 / 1430 » An Approximation Algorithm for Approximation Rank |
202
click to vote
SIAMCOMP
2010
15 years 6 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
238
Voted
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
199
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
216
click to vote
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
We consider a visual scene analysis scenario where objects (e.g. people, cars) pass through the viewing field of a static camera and need to be detected and segmented from the bac...
236
click to vote
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...