526 search results - page 43 / 106 » Increments of Random Partitions |
141
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
116
Voted
ISCAPDCS
2004
15 years 4 months ago
2004
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
137
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
173
Voted
PPOPP
2003
ACM
15 years 8 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
127
Voted
SDM
2009
SIAM
15 years 12 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...