3875 search results - page 419 / 775 » Approximation algorithms for the 0-extension problem |
185
click to vote
IJCSA
2007
15 years 6 months ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
179
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
192
click to vote
ANOR
2010
15 years 4 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
200
Voted
PAMI
2011
15 years 1 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
200
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper studies the problem of outlier detection on uncertain data. We start with a comprehensive model considering both uncertain objects and their instances. An uncertain o...