Sciweavers

6045 search results - page 1054 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
AUTOMATICA
2006
70views more  AUTOMATICA 2006»
13 years 9 months ago
A Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
Juan Carlos Zúñiga, Didier Henrion
CAGD
2006
140views more  CAGD 2006»
13 years 9 months ago
Normal based subdivision scheme for curve design
In this paper we propose a new kind of nonlinear and geometry driven subdivision scheme for curve interpolation. Instead of using linear combination of old vertexes, displacement ...
Xunnian Yang
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 9 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
CSDA
2006
85views more  CSDA 2006»
13 years 9 months ago
Fast and compact smoothing on large multidimensional grids
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
Paul H. C. Eilers, Iain D. Currie, María Du...
DCG
2006
102views more  DCG 2006»
13 years 9 months ago
Three-Dimensional Delaunay Mesh Generation
We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain specified by a piecewise linear complex. Arbitrarily small input angles are allowed, and the inpu...
Siu-Wing Cheng, Sheung-Hung Poon
« Prev « First page 1054 / 1209 Last » Next »