8728 search results - page 308 / 1746 » On Reduct Construction Algorithms |
184
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
144
click to vote
IV
2009
IEEE
16 years 1 months ago
2009
IEEE
Occlusion is an important problem to be solved for readability improvement of 3D visualization techniques. This paper presents an occlusion reduction technique for cityscape-style...
175
click to vote
BIOWIRE
2007
Springer
16 years 27 days ago
2007
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. In particular, r...
173
click to vote
WEA
2005
Springer
16 years 5 days ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
225
click to vote
ECCC
2011
14 years 10 months ago
2011
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...