1871 search results - page 40 / 375 » The Ephemeral Pairing Problem |
184
click to vote
APPROX
2009
Springer
16 years 24 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
160
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
It is a well known classical result that given the image projections of three known world points it is possible to solve for the pose of a calibrated perspective camera to up to f...
139
click to vote
PAIRING
2007
Springer
16 years 9 days ago
2007
Springer
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...
147
click to vote
ANOR
2002
15 years 6 months ago
2002
We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups
197
click to vote
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—This paper presents the FFT (flip-flop tone) DMAC protocol, a tone based MAC protocol using directional antennas to solve the deafness problem, hidden terminal and exposed termi...