Sciweavers

984 search results - page 20 / 197
» ideas 2006
Sort
View
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
KBS
1998
122views more  KBS 1998»
13 years 7 months ago
Concept formation in design
: This paper presents a computationally tractable view on where simple design concepts come from by proposing a paradigm for the formation of design concepts based on the emergence...
John S. Gero
ORL
1998
130views more  ORL 1998»
13 years 7 months ago
Accelerating convergence in the Fermat-Weber location problem
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
Jack Brimberg, Reuven Chen, Doron Chen
PUC
2002
90views more  PUC 2002»
13 years 7 months ago
Data Structures in the Design of Interfaces
Computer science algorithms can be used to improve user interfaces. Using data structures as a source of design ideas, a new interface was constructed for a cellular telephone han...
Gary Marsden, Harold W. Thimbleby, Matt Jones, Pau...
RSA
2008
85views more  RSA 2008»
13 years 7 months ago
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Fan Chung Graham, Ronald L. Graham