160 search results - page 14 / 32 » On Planar Supports for Hypergraphs |
ACSC
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper examines QoS guarantees for bandwidth in mobile wireless networks, with a focus on reducing dropped connections on handoff. We can achieve this by reserving bandwidth f...
111
click to vote
COLT
2008
Springer
15 years 1 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
107
click to vote
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
DCG
2010
14 years 12 months ago
2010
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— This paper discusses the design and current capabilities of a new software tool, dVC, capable of simulating planar systems of bodies experiencing unilateral contacts wi...