3875 search results - page 682 / 775 » Approximation Algorithms for the Max-coloring Problem |
APPROX
2009
Springer
14 years 3 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 ...
KSEM
2009
Springer
14 years 3 months 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...
OOPSLA
2005
Springer
14 years 2 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
ICCV
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper presents a first investigation on the structure from motion problem from the combination of full and weak perspective images. This problem arises in multiresolution obj...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....