Sciweavers

5606 search results - page 441 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICDCN
2011
Springer
14 years 10 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
ICML
2007
IEEE
16 years 7 months ago
Recovering temporally rewiring networks: a model-based approach
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
Fan Guo, Steve Hanneke, Wenjie Fu, Eric P. Xing
CSE
2009
IEEE
16 years 1 months ago
The Social Behaviors of Experts in Massive Multiplayer Online Role-Playing Games
— We examine the social behaviors of game experts in Everquest II, a popular massive multiplayer online role-playing game (MMO). We rely on Exponential Random Graph Models (ERGM)...
David Huffaker, Jing (Annie) Wang, Jeffrey William...
FOCS
2009
IEEE
16 years 1 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
16 years 9 days ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...