2654 search results - page 68 / 531 » On Pairing Inversion Problems |
127
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
Reconstructing networks from time series data is a difficult inverse problem. We apply two methods to this problem using co-temporal functions. Co-temporal functions capture mathe...
120
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
In recent papers it has been suggested that human locomotion may be modeled as an inverse optimal control problem. In this paradigm, the trajectories are assumed to be solutions of...
124
click to vote
DAM
2008
15 years 4 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
145
click to vote
JAL
2006
15 years 4 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
188
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...