Sciweavers

2233 search results - page 139 / 447
» On the Complexity of Theory Curbing
Sort
View
IPL
2006
118views more  IPL 2006»
15 years 6 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
IPL
2006
79views more  IPL 2006»
15 years 6 months ago
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...
ICASSP
2009
IEEE
15 years 4 months ago
Distributed sampling and reconstruction of non-bandlimited fields in sensor networks based on shift-invariant spaces
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
Gunter Reise, Gerald Matz
SIGSOFT
2006
ACM
16 years 10 days ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
NIPS
2007
15 years 7 months ago
Contraction Properties of VLSI Cooperative Competitive Neural Networks of Spiking Neurons
A non–linear dynamic system is called contracting if initial conditions are forgotten exponentially fast, so that all trajectories converge to a single trajectory. We use contra...
Emre Neftci, Elisabetta Chicca, Giacomo Indiveri, ...