Sciweavers

8 search results - page 1 / 2
» On Computing Determinants of Matrices without Divisions
Sort
View
69
Voted
ISSAC
1992
Springer
106views Mathematics» more  ISSAC 1992»
15 years 2 months ago
On Computing Determinants of Matrices without Divisions
Erich Kaltofen
79
Voted
CORR
2008
Springer
82views Education» more  CORR 2008»
14 years 10 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
84
Voted
AAAI
1996
14 years 11 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
79
Voted
ICCV
2003
IEEE
16 years 4 days ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
SI3D
2006
ACM
15 years 4 months ago
Human motion estimation from a reduced marker set
Motion capture data from human subjects exhibits considerable redundancy. In this paper, we propose novel methods for exploiting this redundancy. In particular, we set out to find...
Guodong Liu, Jingdan Zhang, Wei Wang 0010, Leonard...