5 search results - page 1 / 1 » Computational Experience with an Approximation Algorithm on ... |
SODA
1994
ACM
1994
ACM
Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
14 years 6 days ago
PKDD
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
NCA
2008
IEEE
13 years 10 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
CVPR
2012
IEEE
12 years 1 months ago
2012
IEEE
Bottom-up, fully unsupervised segmentation remains a daunting challenge for computer vision. In the cosegmentation context, on the other hand, the availability of multiple images ...