666 search results - page 77 / 134 » Unbalanced Graph Cuts |
129
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
112
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
121
Voted
IPL
2002
15 years 2 months ago
2002
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
122
Voted
ICASSP
2009
IEEE
15 years 11 days ago
2009
IEEE
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We fo...
122
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
We propose a unified approach for summarization based on the analysis of video structures and video highlights. Our approach emphasizes both the content balance and perceptual qua...