Sciweavers

562 search results - page 26 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 10 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
TSP
2010
14 years 4 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
SAC
2005
ACM
15 years 3 months ago
Stochastic scheduling of active support vector learning algorithms
Active learning is a generic approach to accelerate training of classifiers in order to achieve a higher accuracy with a small number of training examples. In the past, simple ac...
Gaurav Pandey, Himanshu Gupta, Pabitra Mitra
84
Voted
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 9 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
FSS
2011
93views more  FSS 2011»
14 years 4 months ago
Upper and lower probabilities induced by a fuzzy random variable
We review two existing interpretations of fuzzy random variables. In the first one, the fuzzy random variable is viewed as a linguistic random variable. In the second case, it re...
Inés Couso, Luciano Sánchez