1709 search results - page 109 / 342 » Comparing the Performance of Database Selection Algorithms |
122
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
127
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
We present a task duplication based scalable scheduling algorithm for Symmetric Multiprocessors (SMP), called S3MP (Scalable Scheduling for SMP), to address the problem of task sc...
138
Voted
ITNG
2006
IEEE
15 years 11 months ago
2006
IEEE
—In this paper, we address the scheduling problem for Clos-network switches with no buffers at the central stage. Existing scheduling (dispatching) algorithms for this type of sw...
130
click to vote
IDA
2007
Springer
15 years 11 months ago
2007
Springer
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
138
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...