Sciweavers

2612 search results - page 234 / 523
» Switching Graphs and Their Complexity
Sort
View
TC
2010
15 years 4 months ago
A Novel Weighted-Graph-Based Grouping Algorithm for Metadata Prefetching
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...
Peng Gu, Jun Wang, Yifeng Zhu, Hong Jiang, Pengju ...
INFOCOM
2012
IEEE
13 years 8 months ago
Scalable routing in 3D high genus sensor networks using graph embedding
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
Xiaokang Yu, Xiaotian Yin, Wei Han, Jie Gao, Xianf...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 3 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
KAIS
2011
129views more  KAIS 2011»
15 years 24 days ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
KDD
2001
ACM
262views Data Mining» more  KDD 2001»
16 years 6 months ago
LOGML: Log Markup Language for Web Usage Mining
Web Usage Mining refers to the discovery of interesting information from user navigational behavior as stored in web access logs. While extracting simple information from web logs...
John R. Punin, Mukkai S. Krishnamoorthy, Mohammed ...