5115 search results - page 663 / 1023 » On Randomized Lanczos Algorithms |
179
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...
182
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
206
Voted
TSMC
2010
15 years 1 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
210
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a method to identify and localize object
classes in images. Instead of operating at the pixel level,
we advocate the use of superpixels as the basic unit of a
class s...
170
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...