3471 search results - page 559 / 695 » Obstacle Numbers of Graphs |
154
Voted
ASIAN
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. A software birthmark is a unique characteristic of a program that can be used as a software theft detection. In this paper we suggest and empirically evaluate a static bi...
178
click to vote
CSL
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
153
click to vote
STACS
2007
Springer
16 years 5 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
129
click to vote
CGO
2006
IEEE
16 years 3 days ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...
145
click to vote
RTCSA
2006
IEEE
16 years 2 days ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...