16404 search results - page 689 / 3281 » A set coverage problem |
189
click to vote
IMA
1999
Springer
15 years 11 months ago
1999
Springer
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which ...
167
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
155
click to vote
GD
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
191
click to vote
GD
2006
Springer
15 years 11 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
190
click to vote
BMVC
2002
15 years 9 months ago
2002
The wide-baseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements...