220 search results - page 9 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
ICDM
2005
IEEE
14 years 9 days ago
2005
IEEE
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
JCSS
2002
13 years 6 months ago
2002
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
SWAT
2010
Springer
13 years 11 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
13 years 6 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
WDAG
2007
Springer
14 years 24 days ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...