Sciweavers

5595 search results - page 953 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
COMPSEC
2010
122views more  COMPSEC 2010»
15 years 4 months ago
Taming role mining complexity in RBAC
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...
JMLR
2010
169views more  JMLR 2010»
15 years 1 months ago
Matrix-Variate Dirichlet Process Mixture Models
We are concerned with a multivariate response regression problem where the interest is in considering correlations both across response variates and across response samples. In th...
Zhihua Zhang, Guang Dai, Michael I. Jordan
ERCIMDL
2008
Springer
181views Education» more  ERCIMDL 2008»
15 years 8 months ago
Author Name Disambiguation for Citations Using Topic and Web Correlation
Abstract. Today, bibliographic digital libraries play an important role in helping members of academic community search for novel research. In particular, author disambiguation for...
Kai-Hsiang Yang, Hsin-Tsung Peng, Jian-Yi Jiang, H...
CGF
2000
207views more  CGF 2000»
15 years 6 months ago
Efficient Glossy Global Illumination with Interactive Viewing
The ability to perform interactive walkthroughs of global illumination solutions including glossy effects is a challenging open problem. In this paper we overcome certain limitati...
Marc Stamminger, Annette Scheel, Xavier Granier, F...
ILP
2004
Springer
15 years 11 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...