Sciweavers

153 search results - page 24 / 31
» Approximating node connectivity problems via set covers
Sort
View
WWW
2010
ACM
15 years 4 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
CIKM
2004
Springer
15 years 3 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
ICDCSW
2005
IEEE
15 years 3 months ago
On Optimal TTL Sequence-Based Route Discovery in MANETs
In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover routes to a remote node via flood...
Dimitrios Koutsonikolas, Saumitra M. Das, Himabind...
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
IJBRA
2008
66views more  IJBRA 2008»
14 years 9 months ago
Integer programming-based approach to allocation of reporter genes for cell array analysis
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
Morihiro Hayashida, Fuyan Sun, Sachiyo Aburatani, ...