17541 search results - page 249 / 3509 » Complexity in scalable computing |
134
click to vote
DEBS
2008
ACM
15 years 5 months ago
2008
ACM
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
128
click to vote
AI
2000
Springer
15 years 3 months ago
2000
Springer
Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly impro...
154
click to vote
JMLR
2010
14 years 11 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
167
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
105
click to vote
SAGA
2007
Springer
15 years 10 months ago
2007
Springer
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...