779 search results - page 61 / 156 » Algorithms for the Sample Mean of Graphs |
155
click to vote
IMC
2010
ACM
15 years 2 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
146
click to vote
DISOPT
2007
15 years 4 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
146
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
327
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, we introduce a novel probabilistic approach to handle occlusions and perspective effects. The proposed method is an object based method embedded in a marked point p...
152
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...