394 search results - page 35 / 79 » Computing Minimal Polynomials of Matrices |
108
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have...
80
Voted
TCOM
2008
15 years 12 days ago
2008
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
95
Voted
IJAR
2006
15 years 15 days ago
2006
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
JAIR
1998
15 years 5 days ago
1998
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
82
Voted
DAC
2010
ACM
15 years 4 months ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...