Sciweavers

6045 search results - page 920 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
CAGD
2006
90views more  CAGD 2006»
15 years 6 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
CGF
2006
151views more  CGF 2006»
15 years 6 months ago
Differential Representations for Mesh Processing
Surface representation and processing is one of the key topics in computer graphics and geometric modeling, since it greatly affects the range of possible applications. In this pa...
Olga Sorkine
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 6 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 6 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
INTEGRATION
2008
101views more  INTEGRATION 2008»
15 years 6 months ago
An efficient terminal and model order reduction algorithm
The paper proposes an efficient terminal and model order reduction method for compact modeling of interconnect circuits with many terminals. The new method is inspired by the rece...
Pu Liu, Sheldon X.-D. Tan, Boyuan Yan, Bruce McGau...