Sciweavers

923 search results - page 98 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
QUESTA
2006
101views more  QUESTA 2006»
15 years 6 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
TOPLAS
2008
101views more  TOPLAS 2008»
15 years 6 months ago
Verifying policy-based web services security
WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract lang...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
JLP
2007
114views more  JLP 2007»
15 years 6 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
TSP
2008
117views more  TSP 2008»
15 years 6 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do
JCT
2010
110views more  JCT 2010»
15 years 4 months ago
Pancyclicity of Hamiltonian and highly connected graphs
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
Peter Keevash, Benny Sudakov