511 search results - page 88 / 103 » Lower bounds for distributed markov chain problems |
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
The creation of a virtual world environment (VWE) has significant costs, such as maintenance of server rooms, server administration, and customer service. The initial development...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
IPPS
1999
IEEE
14 years 2 days ago
1999
IEEE
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...
VLDB
1997
ACM
13 years 12 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...