Sciweavers

4000 search results - page 196 / 800
» Simulation down under
Sort
View
LICS
2005
IEEE
15 years 9 months ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
15 years 5 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
CORR
2006
Springer
166views Education» more  CORR 2006»
15 years 3 months ago
Bounding the Bias of Tree-Like Sampling in IP Topologies
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
Reuven Cohen, Mira Gonen, Avishai Wool
WSC
2004
15 years 5 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja
ASAP
2009
IEEE
182views Hardware» more  ASAP 2009»
16 years 1 months ago
NeMo: A Platform for Neural Modelling of Spiking Neurons Using GPUs
—Simulating spiking neural networks is of great interest to scientists wanting to model the functioning of the brain. However, large-scale models are expensive to simulate due to...
Andreas Fidjeland, Etienne B. Roesch, Murray Shana...