215 search results - page 29 / 43 » Approximating Geometrical Graphs via |
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
STOC
2006
ACM
14 years 3 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
CCCG
2008
13 years 11 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
MVA
2000
13 years 11 months ago
2000
System for automated control and tuning of TVset raster has been developed. The artificial intelligence elements such as multilayer perceptron, RBF and Cohonen networks effectivel...
EM
2010
13 years 10 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...