1871 search results - page 78 / 375 » The Ephemeral Pairing Problem |
NA
2007
14 years 10 months ago
2007
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...
CIAC
2010
Springer
15 years 2 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
125
click to vote
FOCS
2003
IEEE
15 years 4 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
ICIP
1994
IEEE
15 years 3 months ago
1994
IEEE
Many multi-dimensional signal processing problems require the computation of signal gradients or directional derivatives. Traditional derivative estimates based on adjacent or cen...
135
click to vote
ECCC
2007
14 years 11 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...