Sciweavers

736 search results - page 35 / 148
» Approximating the Number of Network Motifs
Sort
View
WSDM
2012
ACM
254views Data Mining» more  WSDM 2012»
13 years 5 months ago
Maximizing product adoption in social networks
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
Smriti Bhagat, Amit Goyal 0002, Laks V. S. Lakshma...
ICASSP
2010
IEEE
14 years 10 months ago
Guaranteed robust distributed estimation in a network of sensors
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...
Jean-Benoist Leger, Michel Kieffer
MOBIHOC
2006
ACM
15 years 9 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
STACS
2007
Springer
15 years 4 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
BMCBI
2010
131views more  BMCBI 2010»
14 years 10 months ago
A comparison of approximation techniques for variance-based sensitivity analysis of biochemical reaction systems
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...
Hong-Xuan Zhang, John Goutsias