14 search results - page 3 / 3 » Small subgraphs in random graphs and the power of multiple c... |
SODA
2012
ACM
11 years 8 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
ASUNAM
2011
IEEE
12 years 6 months ago
2011
IEEE
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
BMCBI
2008
13 years 6 months ago
2008
Background: Amino acids responsible for structure, core function or specificity may be inferred from multiple protein sequence alignments where a limited set of residue types are ...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...