1227 search results - page 76 / 246 » Approximate Kernel Clustering |
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
CGO
2007
IEEE
15 years 4 months ago
2007
IEEE
General-purpose operating systems, such as Linux, are increasingly being used in embedded systems. Computational resources are usually limited, and embedded processors often have ...
NIPS
2004
14 years 11 months ago
2004
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
108
click to vote
CVPR
2012
IEEE
13 years 8 days ago
2012
IEEE
The bag-of-words (BoW) model treats images as an unordered set of local regions and represents them by visual word histograms. Implicitly, regions are assumed to be identically an...