12289 search results - page 579 / 2458 » computing 2006 |
177
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
157
click to vote
IPL
1998
15 years 6 months ago
1998
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...
177
click to vote
JMIV
2002
15 years 6 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
253
click to vote
JCSC
1998
15 years 6 months ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
196
click to vote
KBS
1998
15 years 6 months ago
1998
: 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...