1542 search results - page 296 / 309 » The metamathematics of random graphs |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
INFOCOM
1998
IEEE
14 years 25 days ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
PODC
2010
ACM
14 years 14 days ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
AAAI
2008
13 years 11 months ago
2008
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
BMCBI
2010
13 years 8 months ago
2010
Background: Metabolic pathway is a highly regulated network consisting of many metabolic reactions involving substrates, enzymes, and products, where substrates can be transformed...