1215 search results - page 220 / 243 » Combinatorics |
162
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
150
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
130
click to vote
EMSOFT
2005
Springer
15 years 9 months ago
2005
Springer
We propose a programming model dedicated to real-time videostreaming applications for embedded media devices, including highdefinition TVs. This model is built on the synchronous...
108
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
120
Voted
COCOON
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has bee...