Sciweavers

337 search results - page 27 / 68
» Computational complexity of weighted splitting schemes on pa...
Sort
View
HPCA
2011
IEEE
12 years 11 months ago
Dynamic parallelization of JavaScript applications using an ultra-lightweight speculation mechanism
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
Mojtaba Mehrara, Po-Chun Hsu, Mehrzad Samadi, Scot...
GCA
2008
13 years 9 months ago
Grid-enabling complex system applications with QosCosGrid: An architectural perspective
Grids are becoming mission-critical components in research and industry, offering sophisticated solutions in leveraging largescale computing and storage resources. Grid resources ...
Valentin Kravtsov, David Carmeli, Werner Dubitzky,...
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 8 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
PODC
2006
ACM
14 years 1 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
IEEEPACT
2000
IEEE
14 years 6 days ago
Address Partitioning in DSM Clusters with Parallel Coherence Controllers
Recent research suggests that DSM clusters can benefit from parallel coherence controllers. Parallel controllers require address partitioning and synchronization to avoid handlin...
Ilanthiraiyan Pragaspathy, Babak Falsafi