Sciweavers

4642 search results - page 666 / 929
» Distributed algorithm and reversible network
Sort
View
143
Voted
PODC
2012
ACM
13 years 5 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
121
Voted
ICML
2008
IEEE
16 years 4 months ago
Laplace maximum margin Markov networks
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Jun Zhu, Eric P. Xing, Bo Zhang
142
Voted
SDM
2009
SIAM
185views Data Mining» more  SDM 2009»
16 years 14 days ago
Understanding Importance of Collaborations in Co-authorship Networks: A Supportiveness Analysis Approach.
Co-authorship networks, an important type of social networks, have been studied extensively from various angles such as degree distribution analysis, social community extraction a...
Bin Zhou 0002, Jian Pei, Yan Jia, Yi Han
INFOCOM
2008
IEEE
15 years 9 months ago
End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
Xiaolu Zhang, Wenhua Jiao, Meixia Tao
ICC
2007
IEEE
102views Communications» more  ICC 2007»
15 years 9 months ago
Maximizing Angle Coverage in Visual Sensor Networks
— In this paper, we study the angle coverage problem in visual sensor networks where all sensors are equipped with cameras. An object of interest moves around the network and the...
Kit-Yee Chow, King-Shan Lui, Edmund Y. Lam