248 search results - page 38 / 50 » New Approximation Algorithms for Minimum Cycle Bases of Grap... |
127
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
154
Voted
EMNLP
2011
14 years 3 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
151
Voted
SACMAT
2006
ACM
15 years 9 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
133
Voted
ANOR
2005
15 years 3 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
147
Voted
ICVGIP
2004
15 years 4 months ago
2004
We propose a new unsupervised learning method to obtain a layered pictorial structure (LPS) representation of an articulated object from video sequences. It will be seen that this...