Sciweavers

6274 search results - page 490 / 1255
» From query complexity to computational complexity
Sort
View
RT
1995
Springer
15 years 10 months ago
Multiple Scattering as a Diffusion Process
Multiple scattering in participating media is generally a complex phenomenon. In the limit of an optically thick medium, i.e., when the mean free path of each photon is much smalle...
Jos Stam
PODC
2011
ACM
14 years 9 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
CANS
2007
Springer
150views Cryptology» more  CANS 2007»
16 years 1 months ago
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
Abstract. In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple para...
Arpita Patra, Bhavani Shankar, Ashish Choudhary, K...
CVPR
2003
IEEE
16 years 9 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
PPOPP
2010
ACM
16 years 4 months ago
Application heartbeats for software performance and health
Adaptive, or self-aware, computing has been proposed to help application programmers confront the growing complexity of multicore software development. However, existing approache...
Henry Hoffmann, Jonathan Eastep, Marco D. Santambr...