2430 search results - page 150 / 486 » Computing Tutte Polynomials |
141
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
148
Voted
DSN
2002
IEEE
15 years 9 months ago
2002
IEEE
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
142
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
137
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
111
Voted
TOG
2010
14 years 11 months ago
2010
This paper introduces a fully-Eulerian interface tracking framework that preserves the fine details of liquids. Unlike existing Eulerian methods, the proposed framework shows good...