Sciweavers

7623 search results - page 1213 / 1525
» Algorithmic Features of Eclat
Sort
View
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 10 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
ATAL
2008
Springer
15 years 8 months ago
On the importance of migration for fairness in online grid markets
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
FAST
2004
15 years 8 months ago
CAR: Clock with Adaptive Replacement
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...
Sorav Bansal, Dharmendra S. Modha
NIPS
2004
15 years 8 months ago
Two-Dimensional Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is a well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional d...
Jieping Ye, Ravi Janardan, Qi Li
SIGIR
2010
ACM
15 years 6 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
« Prev « First page 1213 / 1525 Last » Next »