Sciweavers

1612 search results - page 268 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
ICASSP
2010
IEEE
14 years 10 months ago
Motion estimation from compressed linear measurements
This paper presents a novel algorithm for computing the relative motion between images from compressed linear measurements. We propose a geometry based correlation model that desc...
Vijayaraghavan Thirumalai, Pascal Frossard
TPDS
2008
88views more  TPDS 2008»
14 years 9 months ago
A Two-Hop Solution to Solving Topology Mismatch
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
Yunhao Liu
CIKM
2010
Springer
14 years 7 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
CDC
2010
IEEE
173views Control Systems» more  CDC 2010»
14 years 4 months ago
Corrective consensus: Converging to the exact average
Consensus algorithms provide an elegant distributed way for computing the average of a set of measurements across a sensor network. However, the convergence of the node estimates t...
Yin Chen, Roberto Tron, Andreas Terzis, René...
IVC
2008
141views more  IVC 2008»
14 years 9 months ago
Segmentation of color images via reversible jump MCMC sampling
Reversible jump Markov chain Monte Carlo (RJMCMC) is a recent method which makes it possible to construct reversible Markov chain samplers that jump between parameter subspaces of...
Zoltan Kato