Sciweavers

925 search results - page 18 / 185
» A Solution to the Extended GCD Problem
Sort
View
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
14 years 1 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
ECOOP
2004
Springer
14 years 1 months ago
The Expression Problem Revisited
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...
Mads Torgersen
INFOVIS
2005
IEEE
14 years 1 months ago
Dynamic Visualization of Graphs with Extended Labels
The paper describes a novel technique to visualize graphs with extended node and link labels. The lengths of these labels range from a short phrase to a full sentence to an entire...
Pak Chung Wong, Patrick Mackey, Ken Perrine, James...
SPDP
1993
IEEE
13 years 12 months ago
Extended Distributed Genetic Algorithm for Channel Routing
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
B. B. Prahlada Rao, R. C. Hansdah
ENTCS
2007
99views more  ENTCS 2007»
13 years 7 months ago
Extending Symmetry Reduction Techniques to a Realistic Model of Computation
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be repres...
Alastair F. Donaldson, Alice Miller