Sciweavers

28 search results - page 4 / 6
» On the extreme eigenvalues of regular graphs
Sort
View
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
14 years 3 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
ECAI
2008
Springer
13 years 11 months ago
Modeling Collaborative Similarity with the Signed Resistance Distance Kernel
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
Jérôme Kunegis, Stephan Schmidt, Sahi...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 10 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
JGAA
2007
135views more  JGAA 2007»
13 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
IPMI
2007
Springer
14 years 10 months ago
Inter and Intra-modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...