5183 search results - page 338 / 1037 » The Complexity of Distributions |
148
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Distributed work teams are increasingly being implemented to enhance organizational flexibility and competitiveness in today's complex and rapidly changing work environment. ...
142
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper examines the problem of building scalable, fault-tolerant distributed systems from collections of communicating process groups, while maintaining well-defined end-to-en...
183
click to vote
IPPS
1999
IEEE
15 years 11 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....
176
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
This work presents MUSE, a graphical environment for modeling interactive networked multimedia applications. Through an advanced graphic interface and a new highlevel authoring mod...
134
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...