817 search results - page 9 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
183
click to vote
COLT
1998
Springer
15 years 9 months ago
1998
Springer
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
118
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
139
click to vote
TCS
2011
15 years 4 days ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
129
click to vote
SIAMCOMP
2008
15 years 5 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
159
click to vote
DCOSS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...