3894 search results - page 626 / 779 » Approximation Algorithms for Biclustering Problems |
134
Voted
APPROX
2009
Springer
15 years 10 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 ...
161
click to vote
KSEM
2009
Springer
15 years 10 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...
149
Voted
OOPSLA
2005
Springer
15 years 9 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...
126
Voted
ICCV
1999
IEEE
15 years 7 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...
115
Voted
SGP
2007
15 years 6 months ago
2007
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...