Sciweavers

604 search results - page 117 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
ECCV
2002
Springer
14 years 10 months ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec
ICIP
2004
IEEE
14 years 10 months ago
New scaling technique for direct mode coding in B pictures
To leave the maximum flexibility in encoder to optimize the trade-off between coding performance and complexity, in video coding standards such as H.264/AVC [1], H.263 [2] and MPE...
Xiangyang Ji, Debin Zhao, Wen Gao, Yan Lu, Siwei M...
WWW
2009
ACM
14 years 9 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
POPL
2008
ACM
14 years 9 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume