Sciweavers

837 search results - page 36 / 168
» Distributed RAID - A New Multiple Copy Algorithm
Sort
View
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 9 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
MM
2005
ACM
215views Multimedia» more  MM 2005»
14 years 2 months ago
OpenVIDIA: parallel GPU computer vision
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...
James Fung, Steve Mann
PCRCW
1997
Springer
14 years 1 months ago
ChaosLAN: Design and Implementation of a Gigabit LAN Using Chaotic Routing
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
Neil R. McKenzie, Kevin Bolding, Carl Ebeling, Law...
MIDDLEWARE
2007
Springer
14 years 3 months ago
New Worker-Centric Scheduling Strategies for Data-Intensive Grid Applications
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
Steven Y. Ko, Ramsés Morales, Indranil Gupt...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu