Sciweavers

3598 search results - page 409 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
ICTAI
2010
IEEE
15 years 4 months ago
PKOPT: Faster k-Optimal Solution for DCOP by Improving Group Selection Strategy
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
Elnaz Bigdeli, Maryam Rahmaninia, Mohsen Afsharchi
190
Voted
CVPR
2000
IEEE
16 years 8 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
ICMCS
2008
IEEE
138views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Using H.264 coded block patterns for fast inter-mode selection
The support of variable block-sizes, though significantly improves the compression efficiency, imposes a big computational challenge on an H.264 encoder. In this paper, we present...
Bo-Yuan Chen, Shih-Hsuan Yang
ICPP
2008
IEEE
16 years 1 months ago
Fast Source Switching for Gossip-Based Peer-to-Peer Streaming
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
Zhenhua Li, Jiannong Cao, Guihai Chen, Yan Liu