Sciweavers

2034 search results - page 43 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
IPCCC
2006
IEEE
14 years 1 months ago
SHARP: a new real-time scheduling algorithm to improve security of parallel applications on heterogeneous clusters
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
Tao Xie 0004, Xiao Qin, Mais Nijim
CSDA
2006
98views more  CSDA 2006»
13 years 7 months ago
Fast estimation algorithm for likelihood-based analysis of repeated categorical responses
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
Jukka Jokinen
PAMI
2008
198views more  PAMI 2008»
13 years 7 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
MSR
2010
ACM
14 years 28 days ago
A comparative exploration of FreeBSD bug lifetimes
—In this paper, we explore the viability of mining the basic data provided in bug repositories to predict bug lifetimes. We follow the method of Lucas D. Panjer as described in h...
Gargi Bougie, Christoph Treude, Daniel M. Germ&aac...
ICMCS
2006
IEEE
159views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Improving Speaker Diarization by Cross EM Refinement
In this paper, we present a new speaker diarization system that improves the accuracy of traditional hierarchical clustering-based methods with little increase in computational co...
Huazhong Ning, Wei Xu, Yihong Gong, Thomas S. Huan...