Sciweavers

6274 search results - page 334 / 1255
» From query complexity to computational complexity
Sort
View
SIGGRAPH
1993
ACM
15 years 10 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
PERCOM
2006
ACM
16 years 6 months ago
Exploiting information relationships for access control in pervasive computing
Many information services in pervasive computing offer rich information, which is information that includes other types of information. For example, the information listed in a pe...
Urs Hengartner, Peter Steenkiste
PPOPP
2009
ACM
16 years 7 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
TC
2008
15 years 6 months ago
Computationally Efficient PKI-Based Single Sign-On Protocol, PKASSO for Mobile Devices
In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource-constrained de...
Ki-Woong Park, Sang Seok Lim, Kyu Ho Park
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 7 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson