1011 search results - page 165 / 203 » The three dimensions of proofs |
197
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
141
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
244
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...
198
click to vote
ICST
2009
IEEE
16 years 25 days ago
2009
IEEE
In this paper, we consider typical applications in which the business logic is separated from the access control logic, implemented in an independent component, called the Policy ...
200
click to vote
WADS
2009
Springer
16 years 23 days ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...