1161 search results - page 103 / 233 » Kinetic Dependence Graphs |
106
Voted
COMGEO
2002
ACM
15 years 14 days ago
2002
ACM
A fractal construction shows that, for any > 0, the -skeleton of a point set can have arbitrarily large dilation: (nc ), where c is a constant depending on and going to zero ...
111
Voted
JSSPP
2010
Springer
14 years 10 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
120
click to vote
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Recent research has shown that collective classification in relational data often exhibit significant performance gains over conventional approaches that classify instances indi...
116
click to vote
INFORMATICALT
2007
15 years 16 days ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...