1243 search results - page 129 / 249 » Complexity reduction of C-Algorithm |
133
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
114
click to vote
EUROCAST
2005
Springer
15 years 7 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
109
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
104
click to vote
CC
2007
Springer
15 years 1 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Local bundle adjustment (LBA) has recently been introduced
to estimate the geometry of image sequences taken by
a calibrated camera. Its advantage over standard (global)
bundle ...