1857 search results - page 44 / 372 » Minimum Degree Orderings |
124
Voted
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
2010
Eurographics
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
83
Voted
CAGD
2006
15 years 1 months ago
2006
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...
156
Voted
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
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 ...
102
Voted
DCC
2002
IEEE
16 years 19 days ago
2002
IEEE
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...
113
Voted
TALG
2008
15 years 29 days ago
2008
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...