Sciweavers

1370 search results - page 114 / 274
» On grids in topological graphs
Sort
View
BMCBI
2008
208views more  BMCBI 2008»
15 years 6 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
15 years 11 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
ICIP
2009
IEEE
16 years 7 months ago
Exploiting Local Structure For Tracking Plant Cells In Noisy Images
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
CVIU
2008
113views more  CVIU 2008»
15 years 6 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran