3341 search results - page 135 / 669 » On Bounded Queries and Approximation |
102
click to vote
COLOGNETWENTE
2010
14 years 8 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
107
click to vote
MOC
2010
14 years 4 months ago
2010
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
145
click to vote
MCM
2011
14 years 26 days ago
2011
Abstract. In this paper we provide sharp bounds for the error in approximating the Riemann-Stieltjes integral R b a f (t) du (t) by the trapezoidal rule f (a) + f (b) 2 [u (b) u (a...
ASPDAC
1999
ACM
15 years 2 months ago
1999
ACM
: This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into sub...
CG
1999
Springer
14 years 9 months ago
1999
Springer
A convexhull H(S)of a 3Dset S is rarely used to accelerateinterferencedetection or as a substitutefor rendering small projection of S,because it typically has too many faces. An a...