Sciweavers

4940 search results - page 932 / 988
» On the Complexity of Universal Programs
Sort
View
TALG
2010
86views more  TALG 2010»
13 years 8 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
INDOCRYPT
2010
Springer
13 years 7 months ago
Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers
Abstract. This paper presents the first results on AIDA/cube, algebraic and sidechannel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Ou...
Gregory V. Bard, Nicolas Courtois, Jorge Nakahara,...
IPPS
2010
IEEE
13 years 7 months ago
Towards dynamic reconfigurable load-balancing for hybrid desktop platforms
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...
Alécio Pedro Delazari Binotto, Carlos Eduar...
USS
2010
13 years 7 months ago
Toward Automated Detection of Logic Vulnerabilities in Web Applications
Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, ...
Viktoria Felmetsger, Ludovico Cavedon, Christopher...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 6 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely