Sciweavers

64 search results - page 4 / 13
» Cooperation in massively distributed information space
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
ATAL
2003
Springer
15 years 2 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein
CORR
2007
Springer
158views Education» more  CORR 2007»
14 years 9 months ago
Multi-group ML Decodable Collocated and Distributed Space Time Block Codes
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
G. Susinder Rajan, B. Sundar Rajan
DIAU
2000
Springer
15 years 1 months ago
Freenet: A Distributed Anonymous Information Storage and Retrieval System
We describe Freenet, a peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers...
Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodor...
ICC
2008
IEEE
120views Communications» more  ICC 2008»
15 years 3 months ago
Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
Jagadeesh Harshan, B. Sundar Rajan