Sciweavers

5183 search results - page 704 / 1037
» The Complexity of Distributions
Sort
View
CSFW
2007
IEEE
16 years 1 months ago
Secure Implementations for Typed Session Abstractions
mplementations for Typed Session Abstractions Ricardo Corin1,2,3 Pierre-Malo Deni´elou1,2 C´edric Fournet1,2 Karthikeyan Bhargavan1,2 James Leifer1 1 MSR-INRIA Joint Centre 2 Mic...
Ricardo Corin, Pierre-Malo Deniélou, C&eacu...
FSS
2002
84views more  FSS 2002»
15 years 6 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 9 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
SOSP
2005
ACM
16 years 3 months ago
Implementing declarative overlays
Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building a...
Boon Thau Loo, Tyson Condie, Joseph M. Hellerstein...
IADIS
2004
15 years 8 months ago
Moginma: an autonomous grid node monitoring agent
The accelerated development in grid computing has positioned it as a promising next generation computing platform. It enables the creation of virtual organizations (VO) for sharin...
Arshad Ali, Fawad Nazir, Hamid Abbas Burki, Tallat...