2570 search results - page 248 / 514 » Fast Algorithms For The Computation Of Ranklets |
116
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
147
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....
150
click to vote
CGI
1997
IEEE
15 years 8 months ago
1997
IEEE
Electro-magnetic tracking systems are in wide-spread use for measuring 6D positions. However, their accuracy is impaired seriously by distortions of the magnetic fields caused by...
124
click to vote
ACSC
2004
IEEE
15 years 7 months ago
2004
IEEE
Indexes are the key technology underpinning efficient text search. A range of algorithms have been developed for fast query evaluation and for index creation, but update algorithm...
152
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...