Sciweavers

10901 search results - page 378 / 2181
» Approximations in Distributed Optimization
Sort
View
JNS
2010
61views more  JNS 2010»
15 years 5 months ago
Validity and Failure of the Boltzmann Approximation of Kinetic Annihilation
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
Karsten Matthies, Florian Theil
NIPS
2007
15 years 8 months ago
Parallelizing Support Vector Machines on Distributed Computers
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai...
ESA
2009
Springer
94views Algorithms» more  ESA 2009»
16 years 1 months ago
Shape Fitting on Point Sets with Probability Distributions
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
Maarten Löffler, Jeff M. Phillips
160
Voted
CORR
2004
Springer
122views Education» more  CORR 2004»
15 years 6 months ago
Simple Distributed Weighted Matchings
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
Jaap-Henk Hoepman
SSS
2009
Springer
16 years 1 months ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra