1729 search results - page 285 / 346 » Bound Graph Polysemy |
152
click to vote
IANDC
2007
15 years 4 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
116
Voted
JAIR
2007
15 years 4 months ago
2007
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
109
Voted
JCT
2007
15 years 4 months ago
2007
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
149
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
146
click to vote
ATMOS
2010
15 years 3 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...