142 search results - page 1 / 29 » Computing Maximum-Scoring Segments in Almost Linear Time |
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
JGTOOLS
2006
13 years 7 months ago
2006
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
DCC
2009
IEEE
14 years 8 months ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
CG
2006
Springer
13 years 7 months ago
2006
Springer
Blurred segments were introduced by Debled-Rennesson et al. [Segmentation of discrete curves into fuzzy segments. In: 9th IWCIA, Electronic notes in discrete mathematics, vol. 12;...