Sciweavers

725 search results - page 37 / 145
» Bounding Degrees on RPL
Sort
View
MOC
2002
81views more  MOC 2002»
14 years 9 months ago
Optimal a priori error estimates for the hp-version of the local discontinuous Galerkin method for convection--diffusion problem
We study the convergence properties of the hp-version of the local discontinuous Galerkin finite element method for convection-diffusion problems; we consider a model problem in a ...
Paul Castillo, Bernardo Cockburn, Dominik Schö...
MOC
2002
98views more  MOC 2002»
14 years 9 months ago
Bounds for the smallest norm in an ideal class
We develop a method for obtaining upper bounds for the smallest norm among all norms of integral ideals in an ideal class. Applying this to number fields of small degree, we are ab...
Ana-Cecilia de la Maza
JSC
2010
99views more  JSC 2010»
14 years 8 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
NETWORKING
2004
14 years 11 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
73
Voted
INFOVIS
2002
IEEE
15 years 2 months ago
Visualizing Data with Bounded Uncertainty
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
Chris Olston, Jock D. Mackinlay