Sciweavers

1089 search results - page 155 / 218
» Bounds on generalized Frobenius numbers
Sort
View
ICML
2000
IEEE
14 years 9 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 9 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
ASIACRYPT
2003
Springer
14 years 2 months ago
Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemes
Abstract. We study two closely related primitives: Broadcast Encryption and Key Predistribution Schemes (KPS). Broadcast Encryption allows a broadcaster to broadcast an encrypted m...
Nuttapong Attrapadung, Kazukuni Kobara, Hideki Ima...
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 1 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
ANCS
2007
ACM
14 years 27 days ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley