Sciweavers

1857 search results - page 44 / 372
» Minimum Degree Orderings
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Interactive High-Quality Visualization of Higher-Order Finite Elements
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
Markus Üffinger, Steffen Frey, Thomas Ertl
CAGD
2006
94views more  CAGD 2006»
13 years 10 months ago
High order approximation of rational curves by polynomial curves
We show that many rational parametric curves can be interpolated, in a Hermite sense, by polynomial curves whose degree, relative to the number of data being interpolated, is lowe...
Michael S. Floater
ICALP
2001
Springer
14 years 3 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
DCC
2002
IEEE
14 years 10 months ago
Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors
We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a p...
Peng Ding, Jennifer D. Key
TALG
2008
81views more  TALG 2008»
13 years 10 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...