2084 search results - page 21 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
132
click to vote
DAM
2006
15 years 2 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
138
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
105
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
122
click to vote
ICML
2002
IEEE
16 years 3 months ago
2002
IEEE
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
117
Voted
TSP
2008
15 years 2 months ago
2008
In this paper, we consider the problem of estimating an unknown deterministic parameter vector in a linear regression model with random Gaussian uncertainty in the mixing matrix. W...