Sciweavers

13214 search results - page 397 / 2643
» Pseudorandomness for network algorithms
Sort
View
ACMSE
2005
ACM
16 years 13 days ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
218
Voted
CDC
2008
IEEE
187views Control Systems» more  CDC 2008»
16 years 1 months ago
Controlled random access MAC for network utility maximization in wireless networks
— There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the obser...
Robert J. McCabe, Nikolaos M. Freris, P. R. Kumar
201
Voted
IMC
2004
ACM
16 years 9 days ago
Modeling distances in large-scale networks by matrix factorization
In this paper, we propose a model for representing and predicting distances in large-scale networks by matrix factorization. The model is useful for network distance sensitive app...
Yun Mao, Lawrence K. Saul
193
Voted
CORR
2007
Springer
165views Education» more  CORR 2007»
15 years 6 months ago
Comparison of Tree-Child Phylogenetic Networks
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
Gabriel Cardona, Francesc Rosselló, Gabriel...
VTC
2006
IEEE
113views Communications» more  VTC 2006»
16 years 26 days ago
On the Practical Issues in Hop Count Localization of Sensors in a Multihop Network
– Simple algorithms have been developed in the area of node localization in a wireless sensor network. For these simple algorithms to work, several assumptions were made. However...
Eddie B. S. Tan, Joo Ghee Lim, Winston Khoon Guan ...