778 search results - page 36 / 156 » Bounding Smooth Integers |
JCO
2010
14 years 10 months ago
2010
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...
107
click to vote
TIP
2008
14 years 11 months ago
2008
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
FCT
2005
Springer
15 years 5 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
110
click to vote
JCT
2010
14 years 10 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
ICANNGA
2007
Springer
15 years 6 months ago
2007
Springer
Rates of approximation by networks with Gaussian RBFs with varying widths are investigated. For certain smooth functions, upper bounds are derived in terms of a Sobolev-equivalent ...