3604 search results - page 294 / 721 » All Common Subsequences |
154
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
172
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
207
click to vote
PAKDD
2000
ACM
15 years 10 months ago
2000
ACM
In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individu...
161
click to vote
SPIRE
2000
Springer
15 years 10 months ago
2000
Springer
We present new search algorithms to detect the occurrences of any pattern from a given pattern set in a text, allowing in the occurrences a limited number of spurious text charact...
167
click to vote
CP
1995
Springer
15 years 10 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...