4926 search results - page 5 / 986 » Two Graph Algorithms On an Associative Computing Model |
CONCUR
2004
Springer
14 years 28 days ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
MM
2005
ACM
14 years 1 months ago
2005
ACM
With the growth of digital music, the development of music recommendation is helpful for users. The existing recommendation approaches are based on the users’ preference on musi...
ISAAC
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...