2004 search results - page 112 / 401 » Sampling from large graphs |
COLT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
138
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
129
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
We propose Markov chain Monte Carlo sampling methods to address uncertainty estimation in disparity computation. We consider this problem at a postprocessing stage, i.e. once the d...
133
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
149
Voted
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...