Sciweavers

450 search results - page 72 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
ECAI
1992
Springer
14 years 21 days ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
SIGGRAPH
1993
ACM
14 years 21 days ago
Frequency domain volume rendering
The Fourier projection-slice theorem allows projections of volume data to be generated in O(n2 log n) time for a volume of size n3 . The method operates by extracting and inverse ...
Takashi Totsuka, Marc Levoy
ICIP
2007
IEEE
14 years 14 days ago
Finding Optimal Integral Sampling Lattices for a given Frequency Support in Multidimensions
The search for alias-free sampling lattices for a given frequency support, in particular those lattices achieving minimum sampling densities, is a fundamental issue in various app...
Yue M. Lu, Minh N. Do
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
14 years 11 days ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
14 years 10 days ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel