Sciweavers

3228 search results - page 262 / 646
» Computationally Sound Proofs
Sort
View
CSE
2009
IEEE
15 years 8 months ago
An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing
A user stores his personal files in a cloud, and retrieves them wherever and whenever he wants. For the sake of protecting the user data privacy and the user queries privacy, a use...
Qin Liu, Guojun Wang, Jie Wu
COLING
1996
15 years 6 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
TMC
2011
131views more  TMC 2011»
14 years 11 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 8 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
JFP
2000
91views more  JFP 2000»
15 years 4 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren