917 search results - page 74 / 184 » The Generalized Trace-Norm and its Application to Structure-... |
152
click to vote
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
166
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
164
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
157
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
177
click to vote
DESRIST
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...