Sciweavers

130 search results - page 3 / 26
» XQL and proximal nodes
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 11 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
TVCG
2011
100views more  TVCG 2011»
13 years 5 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber
DMSN
2006
ACM
14 years 2 months ago
Processing proximity queries in sensor networks
Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we in...
Yannis Kotidis
INFOCOM
2008
IEEE
14 years 5 months ago
Non-Metric Coordinates for Predicting Network Proximity
—We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metr...
Peter B. Key, Laurent Massoulié, Dan-Cristi...
APVIS
2009
13 years 11 months ago
TugGraph: Path-preserving hierarchies for browsing proximity and paths in graphs
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...
Daniel Archambault, Tamara Munzner, David Auber