Sciweavers

1941 search results - page 111 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
15 years 11 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
MM
2004
ACM
206views Multimedia» more  MM 2004»
15 years 3 months ago
Seeing sounds: exploring musical social networks
Information gathering from multimedia retrieval systems is aided by effective visualization, but the degree to which visualization is effective depends in part on the way the cont...
Piotr D. Adamczyk
GLOBECOM
2009
IEEE
15 years 4 months ago
Feasibility Conditions for Interference Alignment
—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interfere...
Cenk M. Yetis, Tiangao Gou, Syed Ali Jafar, Ahmet ...
INFOCOM
2005
IEEE
15 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
CCR
2005
129views more  CCR 2005»
14 years 9 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft