Sciweavers

20638 search results - page 3598 / 4128
» Network Computing
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 3 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
DCC
2008
IEEE
16 years 6 months ago
Asymmetric Multi-level Diversity Coding
Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , ...
Soheil Mohajer, Chao Tian, Suhas N. Diggavi
SC
2005
ACM
16 years 15 days ago
Intelligent Feature Extraction and Tracking for Visualizing Large-Scale 4D Flow Simulations
Terascale simulations produce data that is vast in spatial, temporal, and variable domains, creating a formidable challenge for subsequent analysis. Feature extraction as a data r...
Fan-Yin Tzeng, Kwan-Liu Ma
PROFES
2005
Springer
16 years 13 days ago
Mega Software Engineering
Abstract. In various fields of computer science, rapidly growing hardware power, such as high-speed network, high-performance CPU, huge disk capacity, and large memory space, has ...
Katsuro Inoue, Pankaj K. Garg, Hajimu Iida, Ken-ic...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
« Prev « First page 3598 / 4128 Last » Next »