3267 search results - page 582 / 654 » Generalized quasirandom graphs |
100
click to vote
JMLR
2010
14 years 9 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
96
Voted
JUCS
2010
14 years 9 months ago
2010
: Ontologies are used to represent a variety of domain knowledge and data collections, scopes, viewpoints and linked heterogeneous information sources. They range from simple topol...
150
click to vote
MFCS
2010
Springer
14 years 9 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
NETWORKS
2010
14 years 9 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
137
click to vote
SWAT
2010
Springer
14 years 9 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...