170 search results - page 7 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
POPL
1994
ACM
13 years 11 months ago
1994
ACM
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...
ALT
2002
Springer
14 years 4 months ago
2002
Springer
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
AI
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we present an approach for recovering a topological map of the environment using only detection events from a deployed sensor network. Unlike other solutions to this...
JCO
2010
13 years 6 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...