1756 search results - page 187 / 352 » Directed scale-free graphs |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
IWOMP
2007
Springer
14 years 2 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
ISIPTA
2003
IEEE
14 years 1 months ago
2003
IEEE
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...
APCHI
1998
IEEE
14 years 16 days ago
1998
IEEE
Direct manipulation interfaces are characterised according to the representation of the task domain: the domain objects and the effect of user operations on those objects. In the ...
IPPS
1996
IEEE
14 years 13 days ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...