4714 search results - page 185 / 943 » The Complexity of Iterated Multiplication |
148
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
123
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The design and development of complex products invariably involves many actors who have different points of view on the problem they are addressing, the product being developed, a...
116
click to vote
IJDSN
2007
15 years 4 months ago
2007
We propose to develop wireless Sensor Networks with Mobile Sinks (MSSN), under high sensor node density, where multiple sensor nodes need to share one single communication channel...
120
Voted
MOC
1998
15 years 3 months ago
1998
We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = n1>n2>...>nd 1 ns1 1 ns2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finit...
173
click to vote
ICRA
2009
IEEE
15 years 1 months ago
2009
IEEE
Color-based tracking methods have proved to be efficient for their robustness qualities. The drawback of such global representation of an object is the lack of information on its s...