659 search results - page 115 / 132 » Dynamic Algorithms for Graph Spanners |
DAGSTUHL
2001
14 years 11 months ago
2001
Software visualization has been almost exclusively tackled from the visual point of view; this means visualization occurs exclusively through the visual channel. This approach has ...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
CF
2007
ACM
15 years 2 months ago
2007
ACM
In this paper we describe a new technique, called pipeline spectroscopy, and use it to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogra...
173
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
APCSAC
2005
IEEE
15 years 3 months ago
2005
IEEE
Conditional branch induced control hazards cause significant performance loss in modern out-of-order superscalar processors. Dynamic branch prediction techniques help alleviate th...