1272 search results - page 112 / 255 » Approximate Parameterized Matching |
123
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
124
Voted
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
125
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
157
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
149
Voted
MOC
2010
14 years 10 months ago
2010
We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed ...