2698 search results - page 139 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
176
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
143
click to vote
ICRA
2006
IEEE
16 years 13 days ago
2006
IEEE
– The paper deals with fitting of planar patches to 3D laser range data obtained by a mobile robot. The number and the initial position of the patches are unknown, hence their es...
151
click to vote
IPL
2008
15 years 6 months ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
223
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
156
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...