5606 search results - page 165 / 1122 » Randomization Techniques for Graphs. |
DATE
2003
IEEE
15 years 6 months ago
2003
IEEE
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...
143
Voted
ITIIS
2010
14 years 7 months ago
2010
Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key...
76
Voted
ENTCS
2008
15 years 21 days ago
2008
We study explicit techniques for detection of safety errors, e.g., depth-first search, directed search, random walk, and bitstate hashing. We argue that it is not important to fin...
83
Voted
ECCV
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Temporal random variation of luminance in images can manifest in film and video due to a wide variety of sources. Typical in archived films, it also affects scenes rec...
82
Voted
GD
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...