2430 search results - page 98 / 486 » Computing Tutte Polynomials |
168
click to vote
GLVLSI
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a novel statistical capacitance extraction method for interconnects considering process variations. The new method, called statCap, is based on the spect...
165
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
116
click to vote
ICDIM
2007
IEEE
15 years 11 months ago
2007
IEEE
Several problems from engineering, chemistry, medicine, etc. can be formulated as a system of equations. Finding a solution for such a system sometimes requires high computational...
136
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
142
click to vote
ICANN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The paper presents a new version of a GMDH type algorithm able to perform an automatic model structure synthesis, robust model parameter estimation and model validation i...