5595 search results - page 917 / 1119 » Approximation Algorithms for Clustering Problems |
273
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
176
click to vote
CGF
2006
15 years 6 months ago
2006
Image-based representations of an object profit from known geometry. The more accurate this geometry is known, the better corresponding pixels in the different images can be align...
213
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
168
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
208
Voted
KSEM
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...