1523 search results - page 139 / 305 » The Computational Complexity of Linear Optics |
WG
2007
Springer
14 years 4 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
ISSAC
2004
Springer
14 years 3 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
ISSAC
1995
Springer
14 years 1 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
DAC
1989
ACM
14 years 1 months ago
1989
ACM
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
AMAI
2006
Springer
13 years 10 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...