4761 search results - page 336 / 953 » Generalizing Boundary Points |
179
click to vote
MOC
1998
15 years 6 months ago
1998
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
204
click to vote
ORDER
2010
15 years 5 months ago
2010
Let r(n) denote the largest integer such that every family C of n pairwise disjoint segments in the plane in general position has r(n) members whose order type can be represented ...
244
click to vote
DAM
2011
15 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
173
click to vote
EJWCN
2010
15 years 1 months ago
2010
We present a general game-theoretical framework for the resource allocation problem in the downlink scenario of distributed wireless small-cell networks, where multiple access poi...
205
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...