Sciweavers

870 search results - page 116 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
COCOON
2007
Springer
15 years 4 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
ICIP
2006
IEEE
15 years 11 months ago
Generation of Long-Term Color and Motion Coherent Partitions
This paper describes a technique for generating partition sequences of regions presenting long-term homogeneity in color and motion coherency in terms of affine models. The techni...
Camilo C. Dorea, Ferran Marqués, Montse Par...
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 1 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
15 years 10 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
SIGCOMM
2010
ACM
14 years 10 months ago
An analysis of social network-based Sybil defenses
Recently, there has been much excitement in the research community over using social networks to mitigate multiple identity, or Sybil, attacks. A number of schemes have been propo...
Bimal Viswanath, Ansley Post, P. Krishna Gummadi, ...