5 search results - page 1 / 1 » A Deterministic Single Exponential Time Algorithm for Most L... |
STOC
2010
ACM
14 years 2 months ago
2010
ACM
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
WABI
2005
Springer
13 years 10 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...