Sciweavers

1439 search results - page 199 / 288
» Fast approximation of centrality
Sort
View
COMPGEOM
2011
ACM
13 years 1 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
14 years 11 months ago
SWAT: Hierarchical Stream Summarization in Large Networks
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
Ahmet Bulut, Ambuj K. Singh
SP
2008
IEEE
285views Security Privacy» more  SP 2008»
14 years 4 months ago
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user pretends to have multiple identities (called sy...
Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky, ...
ACMSE
2007
ACM
14 years 2 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...
ANCS
2007
ACM
14 years 2 months ago
Frame-aggregated concurrent matching switch
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
Bill Lin, Isaac Keslassy