478 search results - page 22 / 96 » Approximation algorithms for general packing problems and th... |
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
IJCAI
1997
13 years 10 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...