1016 search results - page 23 / 204 » Generalized distances between rankings |
176
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
166
click to vote
IMC
2010
ACM
15 years 4 months ago
2010
ACM
Content delivery systems constitute a major portion of today's Internet traffic. While they are a good source of revenue for Internet Service Providers (ISPs), the huge volum...
170
click to vote
STRINGOLOGY
2004
15 years 7 months ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
147
click to vote
ICANNGA
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
169
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...