2374 search results - page 123 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
101
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
To use heterogeneous and geographically distributed resources as a platform for parallel visualization is an intriguing topic of research. This is because of the immense potential...
122
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
110
click to vote
SDM
2008
SIAM
15 years 3 months ago
2008
SIAM
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
135
click to vote
VALUETOOLS
2006
ACM
15 years 8 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
136
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...