1091 search results - page 152 / 219 » Approximation Algorithms for Data Placement Problems |
CVGIP
2007
13 years 8 months ago
2007
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...