1806 search results - page 252 / 362 » Some Functions Computable with a Fused-Mac |
97
Voted
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
115
Voted
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
Images and other high-dimensional data can frequently be characterized by a low dimensional manifold (e.g. one that corresponds to the degrees of freedom of the camera). Recently,...
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
106
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
115
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
Content delivery networks have evolved beyond traditional distributed caching. With services such as Akamai's EdgeComputing it is now possible to deploy and run enterprise bu...