2430 search results - page 136 / 486 » Computing Tutte Polynomials |
164
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
153
Voted
AAAI
2010
15 years 6 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
124
Voted
NIPS
1996
15 years 6 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
129
click to vote
TCS
2008
15 years 4 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
153
Voted
RECOMB
2010
Springer
15 years 3 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...