1736 search results - page 305 / 348 » On antimagic directed graphs |
ASPLOS
1998
ACM
14 years 2 months ago
1998
ACM
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...
SIGGRAPH
1994
ACM
14 years 2 months ago
1994
ACM
We present a new particle-based approach to sampling and controlling implicit surfaces. A simple constraint locks a set of particles onto a surface while the particles and the sur...
ASPDAC
2008
ACM
14 years 7 hour ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
LWA
2007
13 years 11 months ago
2007
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
P2PKM
2004
13 years 11 months ago
2004
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...