1996 search results - page 137 / 400 » Financial Theory 2 |
116
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
108
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
119
click to vote
HICSS
2005
IEEE
15 years 10 months ago
2005
IEEE
We review the literature on Free/Libre Open Source Software (FLOSS) development and on software development, distributed work and teams more generally to develop a theoretical mod...
132
click to vote
ISSAC
2005
Springer
15 years 10 months ago
2005
Springer
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
121
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...