Sciweavers

8196 search results - page 315 / 1640
» Computational Modeling and Complexity Science
Sort
View
CSFW
2008
IEEE
16 years 1 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal

Lecture Notes
564views
17 years 5 months ago
Empirical Finance
These notes cover several topics such as Predicting Asset Returns, Linear Factor Model, Linear Factor Models in SDF Form, Consumption-Based Asset Pricing, Riskneutral Distributions...
Paul Söderlind
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 6 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
FMSD
2010
118views more  FMSD 2010»
15 years 5 months ago
On simulation-based probabilistic model checking of mixed-analog circuits
In this paper, we consider verifying properties of mixed-signal circuits, i.e., circuits for which there is an interaction between analog (continuous) and digital (discrete) values...
Edmund M. Clarke, Alexandre Donzé, Axel Leg...
COSIT
2007
Springer
136views GIS» more  COSIT 2007»
16 years 25 days ago
Spatial Semantics in Difference Spaces
Higher level semantics are considered useful in the geospatial domain, yet there is no general consensus on the form these semantics should take. Indeed, knowledge representation p...
Vlad Tanasescu