Sciweavers

1671 search results - page 265 / 335
» Hierarchical graph maps
Sort
View
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 4 months ago
Ranking hubs and authorities using matrix functions
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
Michele Benzi, Ernesto Estrada, Christine Klymko
ICCV
2005
IEEE
14 years 11 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
ICIP
1999
IEEE
14 years 10 months ago
Water-Filling: A Novel Way for Image Structural Feature Extraction
The performance of a content based image retrieval (CBIR) system is inherently constrained by the features adopted to represent the images in the database. In this paper, a new ap...
Xiang Sean Zhou, Yong Rui, Thomas S. Huang
MOBISYS
2006
ACM
14 years 8 months ago
Building realistic mobility models from coarse-grained traces
In this paper we present a trace-driven framework capable of building realistic mobility models for the simulation studies of mobile systems. With the goal of realism, this framew...
Jungkeun Yoon, Brian D. Noble, Mingyan Liu, Minkyo...
CLUSTER
2008
IEEE
14 years 3 months ago
Redistribution aware two-step scheduling for mixed-parallel applications
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
Sascha Hunold, Thomas Rauber, Frédér...