6102 search results - page 67 / 1221 » Generating Optimizing Specializers |
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
ARCS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Certificate-based authentication of parties provides a powerful means for verifying claimed identities, since communicating partners do not have to exchange secrets in ad...
VLDB
1997
ACM
14 years 8 hour ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
PPAM
2007
Springer
14 years 2 months ago
2007
Springer
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
ICOIN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...