2084 search results - page 60 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
125
click to vote
TNN
2008
14 years 9 months ago
2008
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
ISCAS
2007
IEEE
15 years 4 months ago
2007
IEEE
— The new theory of compressive sensing enables direct analog-to-information conversion of compressible signals at subNyquist acquisition rates. We develop new theory, algorithms...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...