Sciweavers

7228 search results - page 238 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
DRM
2007
Springer
15 years 10 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
STOC
1999
ACM
85views Algorithms» more  STOC 1999»
15 years 8 months ago
A Theorem on Sensitivity and Applications in Private Computation
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
Anna Gál, Adi Rosén
IJACTAICIT
2010
153views more  IJACTAICIT 2010»
14 years 11 months ago
Prediction Using Recurrent Neural Network Based Fuzzy Inference system by the Modified Bees Algorithm
In this paper, a recurrent neural network based fuzzy inference system (RNFIS) for prediction is proposed. A recurrent network is embedded in the RNFIS by adding feedback connecti...
Zahra Khanmirzaei, Mohammad Teshnehlab
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
15 years 5 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
TOCL
2008
113views more  TOCL 2008»
15 years 4 months ago
Abstract state machines capture parallel algorithms: Correction and extension
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
Andreas Blass, Yuri Gurevich