1672 search results - page 128 / 335 » Tightness problems in the plane |
MOR
2010
14 years 9 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
TALG
2010
14 years 9 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
ICALP
2011
Springer
14 years 2 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
102
click to vote
ICS
2010
Tsinghua U.
15 years 3 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
74
Voted
BILDMED
2007
15 years 18 days ago
2007
Abstract. Volume representations of blood vessels acquired by 3D rotational angiography are very suitable for diagnosing an aneurysm. We presented a fully-automatic aneurysm labell...