848 search results - page 89 / 170 » Randomness and the linear degrees of computability |
DAC
2008
ACM
16 years 26 days ago
2008
ACM
In this paper we present an efficient algorithm for extracting the complete statistical distribution of the input impedance of interconnect structures in the presence of a large n...
115
click to vote
WEA
2010
Springer
15 years 6 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
101
click to vote
TSP
2008
14 years 11 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we study the modelling of consensus reaching in a ‘soft’ environment, i.e. when the individual testimonies are expressed as fuzzy preference relations. Here cons...
JACM
2000
14 years 11 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...