253 search results - page 34 / 51 » Faster Approximation of Distances in Graphs |
CVPR
2010
IEEE
13 years 4 months ago
2010
IEEE
We apply the concept of natural gradients to deformable registration. The motivation stems from the lack of physical interpretation for gradients of image-based difference measure...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—In this paper, we study link properties over dynamic radio channels based on analytical models and simulations. Specifically, channel variability and mobility are investigated ...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
WWW
2007
ACM
14 years 7 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...