394 search results - page 54 / 79 » Computing Minimal Polynomials of Matrices |
101
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
STOC
2005
ACM
15 years 6 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
102
Voted
BMCBI
2007
15 years 18 days ago
2007
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
117
Voted
COMGEO
2010
ACM
15 years 17 days ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
188
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU's makes it possible to process more data at highe...