872 search results - page 89 / 175 » Extreme lower probabilities |
FSTTCS
1990
Springer
15 years 4 months ago
1990
Springer
We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(N/P) with high probability, provided each node can process all the in...
118
Voted
NIPS
2008
15 years 2 months ago
2008
Confidence-weighted (CW) learning [6], an online learning method for linear classifiers, maintains a Gaussian distributions over weight vectors, with a covariance matrix that repr...
107
Voted
MASCOTS
2007
15 years 2 months ago
2007
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
102
click to vote
UAI
2003
15 years 2 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
98
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...