Results 1  10
of
16
Finding the k shortest hyperpaths
"... The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. Ho ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks
Finding the K shortest hyperpaths
"... The K shortest paths problem has been extensively studied for many years. E cient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in di erent areas, for example in relation with routing in dynamic networks. Howev ..."
Abstract
 Add to MetaCart
The K shortest paths problem has been extensively studied for many years. E cient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in di erent areas, for example in relation with routing in dynamic networks
Finding the K shortest hyperpaths: algorithms and applications
"... The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. Ho ..."
Abstract
 Add to MetaCart
The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 139 (1 self)
 Add to MetaCart
subsumes the problem of finding optimal hyperpaths in directed hypergraphs (under varying optimization criteria) that has received attention recently. In this paper we present an incremental algorithm for a version of the grammar problem. As a special case of this algorithm we obtain an efficient
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms
 LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... Directed hypergraphs are used in several applications to model different combinatorial structures. A directed hypergraph is defined by a set of nodes and a set of hyperarcs, each connecting a set of source nodes to a single target node. A hyperpath, similarly to the notion of path in directed g ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
graphs, consists of a connection among nodes using hyperarcs. Unlike paths in graphs, however, hyperpaths are suitable of many different definitions of measure, corresponding to different concepts arising in various applications. In this paper we consider the problem of finding optimal hyperpaths
Optimal Traversal of Directed Hypergraphs
, 1992
"... A directed hypergraph is defined by a set of nodes and a set of hyperarcs, each connecting a set of source nodes to a single target node. Directed hypergraphs are used in several contexts to model different combinatorial structures, such as functional dependencies [Ull82], Horn clauses in proposi ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
in propositional calculus [AI91], ANDOR graphs [Nil82], Petri nets [Pet62]. A hyperpath, similarly to the notion of path in directed graphs, consists of a connection among nodes using hyperarcs. Unlike paths in graphs, hyperpaths are suitable of different definitions of measure, corresponding to different
Hypergraphs and fast mining of association rules
, 2003
"... This report presents the work of the first year of my Ph.D, and the main fields of my research activity. The activities I’ve done in this past year can be summarized as follows: Nov. 2002Jun. 2003: I started my doctorate working in the field of Information Retrieval Jul. 2003: I followed a two week ..."
Abstract
 Add to MetaCart
weeks summer school at Lipari focused on “Data Mining and Pattern Matching” May. 2003now: I started to study directed hypergraph, and in particular I focused on algorithms for optimal hyperpaths. I’ll consider their use on making inference on sets of association rules. In the next sections I’ll explain
Modelling of quality of protection in outsourced business processes
 In Proc. of IAS’07. IEEE
"... There is a large number of research papers and standards dedicated to security for outsourced data. Yet, most papers propose new controls to access and protect the data rather than to assess the level of assurance of the whole process that is currently deployed. The main contributions of the paper ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
partners. The approach chooses the concrete business process offering the highest assurance among several possible design alternatives by building an optimal hyperpath traversing the business process. 1
Incremental ShortestPath Problem
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract
 Add to MetaCart
subsumes the problem of finding optimal hyperpaths in directed hypergraphs (under varying optimization criteria) that has received attention recently. In this paper we present an incremental algorithm for a version of the grammar problem. As a special case of this algorithm we obtain an efficient
Dip. Informatica e TLC
"... There is a large number of research papers and standards dedicated to security for outsourced data. Yet, most papers propose new controls to access and protect the data rather than to assess the level of assurance of the whole process that is currently deployed. The main contributions of the paper ..."
Abstract
 Add to MetaCart
partners. The approach chooses the concrete business process offering the highest assurance among several possible design alternatives by building an optimal hyperpath traversing the business process. 1
Results 1  10
of
16