1629 search results - page 296 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
BMCBI
2010
14 years 9 months ago
2010
Background: Microorganisms display vast diversity, and each one has its own set of genes, cell components and metabolic reactions. To assess their huge unexploited metabolic poten...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
ECCC
2006
14 years 9 months ago
2006
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
JCM
2007
14 years 9 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
181
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...