Sciweavers

2925 search results - page 261 / 585
» Information Complexity of Online Problems
Sort
View
ADC
2006
Springer
158views Database» more  ADC 2006»
16 years 19 days ago
Dimensionality reduction in patch-signature based protein structure matching
Searching bio-chemical structures is becoming an important application domain of information retrieval. This paper introduces a protein structure matching problem and formulates i...
Zi Huang, Xiaofang Zhou, Dawei Song, Peter Bruza
ECAI
1994
Springer
15 years 10 months ago
Combining the Lazy Label Evaluation with Focusing Techniques in an ATMS
For large problems the ATMS often becomes the main resource consumer in any reasoning system. We propose an architecture (the 2vATMS) that combines the advantages of two techniques...
Mugur M. Tatar
ICALP
2010
Springer
15 years 8 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
JMLR
2008
159views more  JMLR 2008»
15 years 6 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin