Sciweavers

5606 search results - page 510 / 1122
» Randomization Techniques for Graphs.
Sort
View
SIGIR
2009
ACM
16 years 1 months ago
Entropy-biased models for query representation on the click graph
Query log analysis has received substantial attention in recent years, in which the click graph is an important technique for describing the relationship between queries and URLs....
Hongbo Deng, Irwin King, Michael R. Lyu
195
Voted
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 8 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
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...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
187
Voted
ICFP
2010
ACM
15 years 8 months ago
Bidirectionalizing graph transformations
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hir...
208
Voted
INFOCOM
2010
IEEE
15 years 5 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
220
Voted
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
14 years 9 months ago
Graph cube: on warehousing and OLAP multidimensional networks
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
Peixiang Zhao, Xiaolei Li, Dong Xin, Jiawei Han