2252 search results - page 143 / 451 » Lower Bounds for Dynamic Algorithms |
126
click to vote
TSP
2008
15 years 3 months ago
2008
In this paper, a novel relaying strategy that uses multiple input multiple output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks...
106
click to vote
ARITH
2003
IEEE
15 years 8 months ago
2003
IEEE
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
76
Voted
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
Modeling consistency of style in isogenous fields of patterns (such as character patterns in a word from the same font or writer) can improve classification accuracy. Since such p...
132
Voted
TPDS
1998
15 years 3 months ago
1998
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
126
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...