421 search results - page 40 / 85 » String Distances and Uniformities |
106
Voted
RSA
2008
15 years 3 months ago
2008
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
148
Voted
ECML
2007
Springer
15 years 10 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
134
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
110
click to vote
JEI
2002
15 years 3 months ago
2002
Abstract. We propose a metric to predict the visibility of color halftone textures. This metric is represented by the critical viewing distance below which the halftone textures ca...
151
click to vote
RT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we present a new shadow mapping technique that improves upon the quality of perspective and uniform shadow maps. Our technique uses a perspective transform specifi...