Sciweavers

2261 search results - page 126 / 453
» The problem with scalability
Sort
View
IPPS
2010
IEEE
15 years 2 months ago
Attack-resistant frequency counting
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
Bo Wu, Jared Saia, Valerie King
AAAI
2012
13 years 6 months ago
Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
DDECS
2008
IEEE
137views Hardware» more  DDECS 2008»
15 years 11 months ago
Cluster-based Simulated Annealing for Mapping Cores onto 2D Mesh Networks on Chip
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
Zhonghai Lu, Lei Xia, Axel Jantsch
WDAG
2007
Springer
102views Algorithms» more  WDAG 2007»
15 years 10 months ago
A Denial-of-Service Resistant DHT
We consider the problem of designing scalable and robust information systems based on multiple servers that can survive even massive denial-of-service (DoS) attacks. More precisely...
Baruch Awerbuch, Christian Scheideler
P2P
2005
IEEE
15 years 10 months ago
Video Management in Peer-to-Peer Systems
Providing scalable video services in a peer-to-peer (P2P) environment is challenging. Since videos are typically large and require high communication bandwidth for delivery, many ...
Ying Cai, Zhan Chen, Wallapak Tavanapong