Sciweavers

1016 search results - page 23 / 204
» Generalized distances between rankings
Sort
View
CP
2005
Springer
14 years 3 months ago
Applying Constraint Programming to Rigid Body Protein Docking
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...
Ludwig Krippahl, Pedro Barahona
IMC
2010
ACM
13 years 8 months ago
Improving content delivery using provider-aided distance information
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...
Ingmar Poese, Benjamin Frank, Bernhard Ager, Georg...
STRINGOLOGY
2004
13 years 11 months ago
A Note on Bit-Parallel Alignment Computation
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...
Heikki Hyyrö
ICANNGA
2009
Springer
130views Algorithms» more  ICANNGA 2009»
14 years 4 months ago
String Distances and Uniformities
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 (...
David W. Pearson, Jean-Christophe Janodet
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
14 years 7 months ago
ACG-Adjacent Constraint Graph for General Floorplans
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...
Hai Zhou, Jia Wang