1291 search results - page 28 / 259 » Computing the multiplicity structure in solving polynomial s... |
COR
2010
13 years 7 months ago
2010
We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retai...
BMCBI
2010
13 years 7 months ago
2010
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
DSN
2006
IEEE
13 years 11 months ago
2006
IEEE
We construct, analyze and solve models of systems where a number of servers offer services to an incoming stream of demands. Each server goes through alternating periods of being ...
FOCS
2002
IEEE
14 years 17 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
ICCV
2009
IEEE
15 years 18 days ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...