15 search results - page 3 / 3 » An Almost Optimal Rank Bound for Depth-3 Identities |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
DAGSTUHL
2004
13 years 7 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
JC
2006
13 years 5 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...