691 search results - page 109 / 139 » Non-negative graph embedding |
101
Voted
AHS
2006
IEEE
15 years 4 months ago
2006
IEEE
Sharing Intellectual Property (IP) blocks in today's competitive market poses significant high security risks. In this paper, we present a tutorial for a watermarking approach...
132
Voted
FDL
2004
IEEE
15 years 4 months ago
2004
IEEE
The steadily increasing complexity of embedded systems requires comprehensive methodoloat support the design process from the highest possible abstraction level. In most of the cu...
STACS
2000
Springer
15 years 4 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
84
Voted
ICS
1995
Tsinghua U.
15 years 4 months ago
1995
Tsinghua U.
In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency...
103
Voted
CCCG
2008
15 years 2 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...