7930 search results - page 432 / 1586 » Greedy in Approximation Algorithms |
156
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
162
click to vote
ISAAC
2005
Springer
16 years 11 days ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
166
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
175
click to vote
WSC
2001
15 years 8 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
154
click to vote
IPL
2010
15 years 5 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...