129 search results - page 10 / 26 » arc 2010 |
WG
2010
Springer
13 years 7 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
NETWORKS
2010
13 years 8 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
JCO
2010
13 years 8 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...
ARCS
2010
Springer
13 years 10 months ago
2010
Springer
Processor speed and available computing power constantly increases, enabling computation of more and more complex problems such as numerical simulations of physical processes. In t...
ARC
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. This paper presents a brief tutorial and background on implementing filter banks for spectrum sensing. It discusses the advantages of this approach over standard FFT-base...