Sciweavers

1538 search results - page 54 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
INFOCOM
2007
IEEE
14 years 4 months ago
Towards Topology Aware Networks
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
Christos Gkantsidis, Gagan Goel, Milena Mihail, Am...
INFOVIS
2003
IEEE
14 years 3 months ago
MoireGraphs: Radial Focus+Context Visualization and Interaction for Graphs with Visual Nodes
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed ...
T. J. Jankun-Kelly, Kwan-Liu Ma
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 8 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
INFOCOM
2010
IEEE
13 years 8 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
KDD
2010
ACM
242views Data Mining» more  KDD 2010»
14 years 4 days ago
A scalable two-stage approach for a class of dimensionality reduction techniques
Dimensionality reduction plays an important role in many data mining applications involving high-dimensional data. Many existing dimensionality reduction techniques can be formula...
Liang Sun, Betul Ceran, Jieping Ye