13987 search results - page 327 / 2798 » The Two Guards Problem |
170
Voted
WEA
2005
Springer
16 years 7 days ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
139
click to vote
SEMWEB
2004
Springer
16 years 3 days ago
2004
Springer
The problem of data semantics is establishing and maintaining the correspondence between a data source and its intended subject matter. We review the long history of the problem in...
155
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
180
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 ...
165
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...