Sciweavers

5790 search results - page 921 / 1158
» Distributed programming with distributed authorization
Sort
View
WWW
2005
ACM
16 years 2 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 2 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 2 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
ESORICS
2009
Springer
16 years 2 months ago
Dynamic Enforcement of Abstract Separation of Duty Constraints
Separation of Duty Constraints David Basin1 , Samuel J. Burri1,2 , and G?unter Karjoth2 1 ETH Zurich, Department of Computer Science, Switzerland 2 IBM Research, Zurich Research La...
David A. Basin, Günter Karjoth, Samuel J. Bur...
CCS
2009
ACM
16 years 2 months ago
Logging key assurance indicators in business processes
Management of a modern enterprise is based on the assumption that executive reports of lower-layer management are faithful to what is actually happening in the field. As some well...
Fabio Massacci, Gene Tsudik, Artsiom Yautsiukhin