Sciweavers

948 search results - page 49 / 190
» What can we achieve by arbitrary announcements
Sort
View
ESA
2006
Springer
108views Algorithms» more  ESA 2006»
13 years 11 months ago
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
Matthias Englert, Matthias Westermann
IEEEIAS
2008
IEEE
14 years 2 months ago
A Model for the Study of Privacy Issues in Secure Shell Connections
: The Secure Shell (SSH) protocol strives to protect the privacy of its users in several ways. On one hand, the strong encryption and authentication algorithms that it adopts provi...
Maurizio Dusi, Francesco Gringoli, Luca Salgarelli
IJCNN
2000
IEEE
13 years 11 months ago
Unsupervised Classification of Complex Clusters in Networks of Spiking Neurons
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...
Sander M. Bohte, Johannes A. La Poutré, Joo...
IJCAI
2003
13 years 9 months ago
Consistency and Set Intersection
We propose a new framework to study properties of consistency in a Constraint Network from the perspective of properties of set intersection. Our framework comes with a proof sche...
Yuanlin Zhang, Roland H. C. Yap
JSAC
2006
136views more  JSAC 2006»
13 years 7 months ago
Secure data communication in mobile ad hoc networks
We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multihop wireless network with frequently changing topology. To effectivel...
Panagiotis Papadimitratos, Zygmunt J. Haas