Sciweavers

473 search results - page 53 / 95
» Using transportation distances for measuring melodic similar...
Sort
View
CP
2009
Springer
16 years 1 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
136
Voted
WWW
2009
ACM
13 years 8 months ago
The slashdot zoo: mining a social network with negative edges
We analyse the corpus of user relationships of the Slashdot technology news site. The data was collected from the Slashdot Zoo feature where users of the website can tag other user...
J. Kunegis, A. Lomatzsch, and C. Bauckhage
108
Voted
CSMR
2004
IEEE
15 years 4 months ago
The Weighted Combined Algorithm: A Linkage Algorithm for Software Clustering
Software systems need to evolve as business requirements, technology and environment change. As software is modified to accommodate the required changes, its structure deteriorate...
Onaiza Maqbool, Haroon A. Babri
132
Voted
CASES
2005
ACM
15 years 2 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
113
Voted
CMOT
2004
141views more  CMOT 2004»
15 years 9 days ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander