1162 search results - page 100 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
ITCC
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
IPL
2002
13 years 8 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
ICCAD
1997
IEEE
14 years 13 days ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
AHS
2006
IEEE
13 years 12 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...