215 search results - page 3 / 43 » Approximating Geometrical Graphs via |
COMBINATORICA
2010
13 years 2 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
SDM
2010
SIAM
13 years 8 months ago
2010
SIAM
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
ISNN
2004
Springer
14 years 23 days ago
2004
Springer
This paper presents a preliminary study on the nonlinear approximation capability of feedforward neural networks (FNNs) via a geometric approach. Three simplest FNNs with at most f...
AAIM
2008
Springer
14 years 1 months ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...