Sciweavers

92 search results - page 13 / 19
» A Generic Framework for Context-Sensitive Analysis of Modula...
Sort
View
ICFP
2008
ACM
14 years 7 months ago
A scheduling framework for general-purpose parallel languages
The trend in microprocessor design toward multicore and manycore processors means that future performance gains in software will largely come from harnessing parallelism. To reali...
Matthew Fluet, Mike Rainey, John H. Reppy
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CSMR
2009
IEEE
14 years 2 months ago
Comparing Stability of Implementation Techniques for Multi-agent System Product Lines
Multi-agent systems (MAS) are increasingly being exploited to support autonomous recommendation of products and information to contemporary application users. Multi-agent system p...
Camila Nunes, Uirá Kulesza, Cláudio ...
CHES
2010
Springer
187views Cryptology» more  CHES 2010»
13 years 8 months ago
Garbled Circuits for Leakage-Resilience: Hardware Implementation and Evaluation of One-Time Programs - (Full Version)
The power of side-channel leakage attacks on cryptographic implementations is evident. Today's practical defenses are typically attack-specific countermeasures against certain...
Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Re...
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 3 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman