1871 search results - page 13 / 375 » The Ephemeral Pairing Problem |
ICPR
2004
IEEE
16 years 4 days ago
2004
IEEE
The following data fusion problem is considered: Given a 3D geometric model of an object and two uncalibrated images of the same object, and assuming that the object surface is te...
ICCS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
IPL
2007
14 years 11 months ago
2007
Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with r...
JCT
2011
14 years 6 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
LOPSTR
2009
Springer
15 years 5 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...