17760 search results - page 76 / 3552 » A Generalization of the Massey-Ding Algorithm |
120
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
138
click to vote
SIGMOD
2000
ACM
15 years 5 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
114
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Recent advances in Multiple Kernel Learning (MKL) have positioned it as an attractive tool for tackling many supervised learning tasks. The development of efficient gradient desce...
110
click to vote
SACMAT
2005
ACM
15 years 7 months ago
2005
ACM
We investigate a generalization of the notion of XML security view introduced by Stoica and Farkas [17] and later refined by Fan et al. [8]. The model consists of access control ...
115
click to vote
COR
2006
15 years 1 months ago
2006
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....