Sciweavers

1068 search results - page 76 / 214
» On Space Bounded Server Algorithms
Sort
View
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 7 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
MSS
2007
IEEE
105views Hardware» more  MSS 2007»
14 years 2 months ago
Quota enforcement for high-performance distributed storage systems
Storage systems manage quotas to ensure that no one user can use more than their share of storage, and that each user gets the storage they need. This is difficult for large, dis...
Kristal T. Pollack, Darrell D. E. Long, Richard A....
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 7 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
ANOR
2010
112views more  ANOR 2010»
13 years 8 months ago
The Multi-Story Space Assignment Problem
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu
IJCGA
2002
73views more  IJCGA 2002»
13 years 7 months ago
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
Alexander Wolff, Michael Thon, Yin-Feng Xu