Sciweavers

5550 search results - page 49 / 1110
» Different Approaches to Proof Systems
Sort
View
PERCOM
2005
ACM
16 years 5 months ago
Secure context-sensitive authorization
There is a recent trend toward rule-based authorization systems to achieve flexible security policies. Also, new sensing technologies in pervasive computing make it possible to de...
Kazuhiro Minami, David Kotz
180
Voted
FOCS
1995
IEEE
15 years 9 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
DAMON
2009
Springer
16 years 20 days ago
A new look at the roles of spinning and blocking
Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to prot...
Ryan Johnson, Manos Athanassoulis, Radu Stoica, An...
DASFAA
2007
IEEE
134views Database» more  DASFAA 2007»
16 years 13 days ago
Eliciting Matters - Controlling Skyline Sizes by Incremental Integration of User Preferences
Today, result sets of skyline queries are unmanageable due to their exponential growth with the number of query predicates. In this paper we discuss the incremental re-computation ...
Wolf-Tilo Balke, Ulrich Güntzer, Christoph Lo...
ENTCS
2007
97views more  ENTCS 2007»
15 years 6 months ago
A Head-to-Head Comparison of de Bruijn Indices and Names
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
Stefan Berghofer, Christian Urban