14 search results - page 3 / 3 » om 1998 |
89
Voted
SPAA
1998
ACM
15 years 4 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
132
Voted
CATS
1998
15 years 2 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
107
click to vote
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
139
Voted
TIP
1998
15 years 9 days ago
1998
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...