Sciweavers

1154 search results - page 32 / 231
» On the editing distance of graphs
Sort
View
WIOPT
2010
IEEE
13 years 7 months ago
Static community detection algorithms for evolving networks
—Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform thei...
Thomas Aynaud, Jean-Loup Guillaume
CHI
1997
ACM
14 years 26 days ago
Overlaying Motion, Time and Distance in 3-Space
An innovative method for visually and functionally combining the elements of motion, time and distance in a three-dimensional computer animation is presented. At a glance, the ela...
Mike Pell
ICASSP
2009
IEEE
14 years 3 months ago
Evaluating digital audio authenticity with spectral distances and ENF phase change
This paper discusses the use of spectral distances obtained from adaptive filters employed as linear predictors and phase change of the electric network frequency to evaluate dig...
Daniel Patricio Nicolalde, Jose Antonio Apolinario
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 9 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
BMCBI
2007
265views more  BMCBI 2007»
13 years 8 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...