Sciweavers

2168 search results - page 431 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
CSR
2010
Springer
15 years 4 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma
ICALP
2010
Springer
15 years 4 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie
SACMAT
2009
ACM
15 years 4 months ago
A formal framework to elicit roles with business meaning in RBAC systems
The role-based access control (RBAC) model has proven to be cost effective to reduce the complexity and costs of access permission management. To maximize the advantages offered...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...
COMPGEOM
2005
ACM
15 years 1 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
ATAL
2010
Springer
15 years 18 days ago
Opportunistic belief reconciliation during distributed interactions
Successful interaction between autonomous agents is contingent on those agents making decisions consistent with the expectations of their peers -- these expectations are based on ...
Paul Martin, David Robertson, Michael Rovatsos