Sciweavers

101 search results - page 5 / 21
» Exact Analysis of Montgomery Multiplication
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
14 years 25 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
14 years 1 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
BMCBI
2007
218views more  BMCBI 2007»
13 years 7 months ago
Annotation and query of tissue microarray data using the NCI Thesaurus
Background: The Stanford Tissue Microarray Database (TMAD) is a repository of data serving a consortium of pathologists and biomedical researchers. The tissue samples in TMAD are ...
Nigam H. Shah, Daniel L. Rubin, Inigo Espinosa, Ke...
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
14 years 21 days ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...