301 search results - page 40 / 61 » On Finding Dense Subgraphs |
94
Voted
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
NETWORKING
2010
14 years 11 months ago
2010
We carry out a longitudinal study of evolution of small-time scaling behavior of Internet traffic on the MAWI dataset spanning 8 years. MAWI dataset contains a number of anomalies ...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...