6365 search results - page 1003 / 1273 » Fast Local Computation Algorithms |
176
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
180
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
197
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
190
click to vote
CAL
2007
15 years 6 months ago
2007
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
183
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...