2485 search results - page 249 / 497 » Time Bounded Frequency Computations |
DAWAK
2011
Springer
12 years 8 months ago
2011
Springer
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
WG
2004
Springer
14 years 1 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
RANDOM
2001
Springer
14 years 23 days ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
IPPS
2000
IEEE
14 years 22 days ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...