Sciweavers

2228 search results - page 281 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
WWW
2011
ACM
14 years 11 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
INFOCOM
1998
IEEE
15 years 8 months ago
QoS Routing in Networks with Uncertain Parameters
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
Dean H. Lorenz, Ariel Orda
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 4 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
TMC
2008
91views more  TMC 2008»
15 years 4 months ago
Efficient and Resilient Backbones for Multihop Wireless Networks
We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...
Seungjoon Lee, Bobby Bhattacharjee, Aravind Sriniv...
TON
2008
107views more  TON 2008»
15 years 4 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...