2698 search results - page 297 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
161
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
159
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
172
click to vote
SMA
2006
ACM
16 years 16 days ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
156
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ...
180
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...