736 search results - page 41 / 148 » Approximating the Number of Network Motifs |
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
SIGMOD
2011
ACM
14 years 20 days ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
BMCBI
2008
14 years 10 months ago
2008
Background: DNA microarray technology allows for the measurement of genome-wide expression patterns. Within the resultant mass of data lies the problem of analyzing and presenting...
BMCBI
2005
14 years 9 months ago
2005
Background: The SH3 domain family is one of the most representative and widely studied cases of so-called Peptide Recognition Modules (PRM). The polyproline II motif PxxP that gen...