307 search results - page 21 / 62 » Low-Distortion Embeddings of Trees |
ECRTS
2002
IEEE
14 years 19 days ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
DAM
2002
13 years 7 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
WCE
2007
13 years 8 months ago
2007
— In this paper, we attempt to develop image watermarking algorithms which are portable to a variety of applications such as copyright protection, fingerprinting and identificati...
CCCG
2009
13 years 8 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
IWPC
2008
IEEE
14 years 2 months ago
2008
IEEE
Reusing syntax specifications without embedded arbitrary semantic actions is straightforward because the semantic analysis phases of new applications can feed off trees or other ...