Sciweavers

1291 search results - page 54 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
ESOP
1999
Springer
13 years 12 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
LSSC
2005
Springer
14 years 1 months ago
Improved Solution Enclosures for Over- and Underdetermined Interval Linear Systems
Abstract. In this paper we discuss an inclusion method for solving rectangular (over- and under-determined) dense linear systems where the input data are uncertain and vary within ...
Evgenija D. Popova
ICC
2007
IEEE
14 years 2 months ago
A Low-Complexity Path Metric for Tree-Based Multiple-Antenna Detectors
— Traditional multiple-antenna detectors – which search a tree or a lattice structure – typically apply a metric that requires a preprocessing. Contrary to that, we present a...
Christian Kuhn, Norbert Görtz
ECCV
1998
Springer
14 years 9 months ago
A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analy...
Raouf Benjemaa, Francis Schmitt
ANOR
2002
99views more  ANOR 2002»
13 years 7 months ago
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
Mark S. Daskin, Collette R. Coullard, Zuo-Jun Max ...