4377 search results - page 505 / 876 » Mass problems and randomness |
212
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
192
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
202
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
186
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Many natural objects vary the shapes as linear combinations of certain bases. The measurement of such deformable shapes is coupling of rigid similarity transformations between the...
179
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...