15073 search results - page 375 / 3015 » Probabilistic algorithms for computing resultants |
151
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
138
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
We propose an algorithm for large displacement opti-
cal flow estimation which does not require the commonly
used coarse-to-fine warping strategy. It is based on a
quadratic rel...
156
click to vote
DAC
2007
ACM
16 years 6 months ago
2007
ACM
Power integrity simulation for system-on-package (SoP) based modules is a crucial bottleneck in the SoP design flow. In this paper, the multi-layer finite difference method (M-FDM...
137
click to vote
SOFSEM
2009
Springer
15 years 9 months ago
2009
Springer
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
127
click to vote
APN
2009
Springer
15 years 9 months ago
2009
Springer
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...