Sciweavers

1225 search results - page 142 / 245
» The Instance Complexity Conjecture
Sort
View
PADL
2010
Springer
14 years 6 months ago
Skeleton Composition Using Remote Data
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
Mischa Dieterle, Thomas Horstmeyer, Rita Loogen
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 4 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
ATAL
2009
Springer
14 years 3 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
IWANN
2009
Springer
14 years 3 months ago
Switching Dynamics of Neural Systems in the Presence of Multiplicative Colored Noise
We study the dynamics of a simple bistable system driven by multiplicative correlated noise. Such system mimics the dynamics of classical attractor neural networks with an addition...
Jorge F. Mejías, Joaquín J. Torres, ...
FSE
2007
Springer
103views Cryptology» more  FSE 2007»
14 years 3 months ago
Improved Slide Attacks
Abstract. The slide attack is applicable to ciphers that can be represented as an iterative application of the same keyed permutation. The slide attack leverages simple attacks on ...
Eli Biham, Orr Dunkelman, Nathan Keller