Sciweavers

858 search results - page 58 / 172
» One Is Enough!
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 9 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran
CMS
2011
229views Communications» more  CMS 2011»
12 years 8 months ago
Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version)
Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...
Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sa...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 3 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
ASWEC
2006
IEEE
14 years 20 days ago
A Java Reuse Repository for Eclipse using LSI
Software Reuse is a concept that is frequently mentioned as a way to improve software developers' productivity. However, there are a number of issues that need to be addresse...
Ming-Yang (Jerry) Lin, Robert Amor, Ewan D. Temper...
ATMOS
2007
114views Optimization» more  ATMOS 2007»
13 years 10 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...