54 search results - page 11 / 11 » The Complexity of Perfect Matching Problems on Dense Hypergr... |
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
MICCAI
2010
Springer
13 years 2 months ago
2010
Springer
Groupwise registration has been widely investigated in recent years due to its importance in analyzing population data in many clinical applications. To our best knowledge, most o...