225 search results - page 31 / 45 » From polynomial time queries to graph structure theory |
110
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
100
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
CCS
2007
ACM
15 years 3 months ago
2007
ACM
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...