1054 search results - page 94 / 211 » Capacitated Domination Problem |
116
Voted
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider the problem of learning to map between two vector spaces given pairs of matching vectors, one from each space. This problem naturally arises in numerous vision problem...
128
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
122
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
211
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
111
Voted
DCC
2002
IEEE
16 years 2 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...