2430 search results - page 422 / 486 » Computing Tutte Polynomials |
137
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
125
click to vote
RECOMB
1997
Springer
15 years 6 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
122
click to vote
CGO
2003
IEEE
15 years 6 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
137
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...
130
Voted
CGF
2005
15 years 2 months ago
2005
We present a novel framework for the efficient simulation and animation of discrete thin shells. Our method takes a point sampled surface as input and performs all necessary compu...