394 search results - page 15 / 79 » Computing Minimal Polynomials of Matrices |
119
click to vote
PPAM
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
101
Voted
ICCS
2005
Springer
15 years 8 months ago
2005
Springer
Computing a few eigenpairs of large-scale matrices is a significant problem in science and engineering applications and a very active area of research. In this paper, two methods...
110
click to vote
PDCAT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...
110
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
135
Voted
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...