1091 search results - page 70 / 219 » Approximation Algorithms for Data Placement Problems |
JMLR
2012
11 years 10 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a statistical learning-based solution to the camera calibration problem in which the Support Vector Machines (SVM) are used for the estimation of the projectio...
23
Voted
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
JACM
2000
13 years 7 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
DAGM
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...