1291 search results - page 32 / 259 » Computing the multiplicity structure in solving polynomial s... |
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
In this paper, we present an analytical method for computing the globally optimal estimates of orthogonal vanishing points in a “Manhattan world” with a calibrated camera. We ...
TIM
2010
13 years 2 months ago
2010
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
ICISC
2004
13 years 9 months ago
2004
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
The paper presents a software component that enables NetSolve with direct communications between servers in a non-intrusive and incremental way. Non-intrusiveness means that the s...
RECOMB
1997
Springer
13 years 11 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...