6598 search results - page 933 / 1320 » Graph Theory with Applications |
250
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
In this demonstration, we will present LEARNPADS, a fully automatic system for generating ad hoc data processing tools. When presented with a collection of ad hoc data, the system...
190
click to vote
PPOPP
2010
ACM
16 years 4 months ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
212
Voted
WEA
2010
Springer
16 years 1 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
173
click to vote
CCGRID
2009
IEEE
16 years 1 months ago
2009
IEEE
— As the scale and complexity of parallel systems continue to grow, failures become more and more an inevitable fact for solving large-scale applications. In this research, we pr...
194
Voted
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...