1272 search results - page 195 / 255 » Approximate Parameterized Matching |
102
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
150
click to vote
PODS
2009
ACM
15 years 11 months ago
2009
ACM
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
VLSID
2002
IEEE
15 years 11 months ago
2002
IEEE
The improved T and improved n models are proposed for onchip interconnect macromodeling. Using global approximations, simple approximation frames are derived and applied to modeli...
KDD
2009
ACM
15 years 6 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
Compressive sensing (CS) has been proposed for signals with sparsity in a linear transform domain. We explore a signal dependent unknown linear transform, namely the impulse respo...