3055 search results - page 165 / 611 » Randomized Search Trees |
114
click to vote
IDA
1999
Springer
15 years 5 months ago
1999
Springer
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
104
click to vote
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
94
Voted
SIGIR
2008
ACM
15 years 18 days ago
2008
ACM
We introduce a novel approach to expert finding based on multi-step relevance propagation from documents to related candidates. Relevance propagation is modeled with an absorbing ...
93
Voted
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...