2654 search results - page 54 / 531 » On Pairing Inversion Problems |
113
click to vote
JCT
2011
14 years 11 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
148
click to vote
LOPSTR
2009
Springer
15 years 11 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
121
click to vote
DIS
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
140
click to vote
SODA
1998
ACM
15 years 5 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
142
click to vote
GRAPHITE
2006
ACM
15 years 10 months ago
2006
ACM
In recent years many tone mapping operators (TMOs) have been presented in order to display high dynamic range images (HDRI) on typical display devices. TMOs compress the luminance ...