219 search results - page 34 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
149
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
180
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
138
click to vote
IPCO
2010
15 years 5 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
111
click to vote
ICSE
2010
IEEE-ACM
15 years 6 months ago
2010
IEEE-ACM
Many computations exhibit a trade off between execution time and quality of service. A video encoder, for example, can often encode frames more quickly if it is given the freedom ...
178
click to vote
SAC
2006
ACM
15 years 4 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...