2503 search results - page 128 / 501 » A study of 3-arc graphs |
162
click to vote
IPMI
2007
Springer
16 years 7 months ago
2007
Springer
The interest in registering a set of images has quickly risen in the field of medical image analysis. Mutual information (MI) based methods are well-established for pairwise regist...
172
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
171
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
207
click to vote
RSA
2010
15 years 4 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
178
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...