1089 search results - page 18 / 218 » Bounds on generalized Frobenius numbers |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
WG
2000
Springer
13 years 11 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
ARC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
CIAC
2010
Springer
14 years 13 days ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
RSA
2002
13 years 7 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...