AAIM
2007
Springer
14 years 8 months ago
2007
Springer
PI controller has attracted researchers in industrial control processes because of its simplicity and robust performance in a wide range of operating conditions. It has been used t...
AAIM
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
AAECC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) ...
AAECC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Commutative semifields in odd characteristic can be equivalently described by planar functions (also known as PN functions). We describe a method to construct a semifield...
AAECC
2009
Springer
14 years 8 months ago
2009
Springer
We propose a new efficient certificateless aggregate signature scheme which has the advantages of both aggregate signatures and certificateless cryptography. The scheme is proven e...
WDAG
1990
Springer
14 years 8 months ago
1990
Springer
WDAG
1990
Springer
14 years 8 months ago
1990
Springer
Traditional problems in distributed systems include the Reliable Broadcast, Distributed Consensus, and Distributed Firing Squad problems. These problems require coordination only ...
WDAG
1990
Springer
14 years 8 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
AAIM
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
SWAT
1990
Springer
14 years 8 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...