2018 search results - page 141 / 404 » Magnitude-preserving ranking algorithms |
152
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
131
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
147
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
142
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...
146
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...