Sciweavers

21324 search results - page 378 / 4265
» Making the case for computing
Sort
View
EUROSYS
2010
ACM
16 years 2 months ago
Splitter: A Proxy-based Approach for Post-Migration Testing of Web Applications
The benefits of virtualized IT environments, such as compute clouds, have drawn interested enterprises to migrate their applications onto new platforms to gain the advantages of ...
Xiaoning Ding, Hai Huang, Yaoping Ruan, Anees Shai...
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
15 years 11 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
139
Voted
CF
2004
ACM
15 years 8 months ago
Reducing traffic generated by conflict misses in caches
Off-chip memory accesses are a major source of power consumption in embedded processors. In order to reduce the amount of traffic between the processor and the off-chip memory as ...
Pepijn J. de Langen, Ben H. H. Juurlink
239
Voted
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 4 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
154
Voted
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
15 years 10 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen