Sciweavers

281 search results - page 48 / 57
» The Proof Complexity of Linear Algebra
Sort
View
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
TOG
2002
162views more  TOG 2002»
13 years 7 months ago
Interactive skeleton-driven dynamic deformations
This paper presents a framework for the skeleton-driven animation of elastically deformable characters. A character is embedded in a coarse volumetric control lattice, which provi...
Steve Capell, Seth Green, Brian Curless, Tom Ducha...
SIAMREV
2010
170views more  SIAMREV 2010»
13 years 2 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 5 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
CIE
2010
Springer
13 years 8 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov