Sciweavers

8663 search results - page 1491 / 1733
» 10 papers on network models
Sort
View
CCR
2006
117views more  CCR 2006»
15 years 6 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
ENTCS
2006
124views more  ENTCS 2006»
15 years 6 months ago
A New Rabin-type Trapdoor Permutation Equivalent to Factoring
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
Katja Schmidt-Samoa
EOR
2006
134views more  EOR 2006»
15 years 6 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
IJIIDS
2008
95views more  IJIIDS 2008»
15 years 6 months ago
Tightly-coupled GIS data in GNSS fix computations with integrity testing
: Global Navigation Satellite Systems (GNSS) are often used to localise a receiver with respect to a given map. This association problem, also known as map-matching, is usually add...
Clément Fouque, Philippe Bonnifait
IJNSEC
2008
108views more  IJNSEC 2008»
15 years 6 months ago
Multiplicative Forward-Secure Threshold Signature Scheme
The devastating consequence of secret key exposure in digital signature is that any signature can be forged and cannot be trusted. To mitigate the damage of secret key exposure, f...
Sherman S. M. Chow, H. W. Go, Lucas Chi Kwong Hui,...
« Prev « First page 1491 / 1733 Last » Next »