Sciweavers

497 search results - page 99 / 100
» Networking Support for Large Scale Multiprocessor Servers
Sort
View
PODC
2012
ACM
11 years 10 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
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 7 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
ISPAN
2005
IEEE
14 years 1 months ago
Supervised Peer-to-Peer Systems
In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peer-to-peer system is a system in which the overlay network is formed b...
Kishore Kothapalli, Christian Scheideler
ALGOSENSORS
2007
Springer
14 years 1 months ago
Counting Targets with Mobile Sensors in an Unknown Environment
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
Beat Gfeller, Matús Mihalák, Subhash...
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
13 years 11 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp