Sciweavers

1730 search results - page 167 / 346
» Algebra and Computation
Sort
View
SODA
1990
ACM
49views Algorithms» more  SODA 1990»
15 years 5 months ago
Factor Refinement
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
Eric Bach, James R. Driscoll, Jeffrey Shallit
146
Voted
JCB
2006
144views more  JCB 2006»
15 years 3 months ago
Modeling Virus Self-Assembly Pathways: Avoiding Dynamics Using Geometric Constraint Decomposition
We develop a model for elucidating the assembly pathways by which an icosahedral viral shell forms from 60 identical constituent protein monomers. This poorly understood process a...
Meera Sitharam, Mavis Agbandje-Mckenna
126
Voted
ICCV
2007
IEEE
15 years 10 months ago
Multilinear Projection for Appearance-Based Recognition in the Tensor Framework
Numerical multilinear (tensor) algebra is a principled mathematical approach to disentangling and explicitly and parsimoniously representing the essential factors or modes of imag...
M. Alex O. Vasilescu, Demetri Terzopoulos
157
Voted
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 5 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
IPPS
2000
IEEE
15 years 8 months ago
Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...
Andreas C. Döring, Gunther Lustig