3466 search results - page 321 / 694 » Fast computation of special resultants |
161
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
156
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
165
click to vote
SIGGRAPH
2010
ACM
15 years 10 months ago
2010
ACM
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
168
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
220
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
This paper proposes a simple and computationally inexpensive method for animation of clouds. The cloud evolution is simulated using cellular automaton that simplifies the dynamics...