817 search results - page 4 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
ISBRA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. DNA copy number is the number of replicates of a contiguous segment of DNA on the genome. Copy number alteration (CNA) is a genetic abnormality in which the number of the...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
WG
1998
Springer
14 years 23 days ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....