6568 search results - page 375 / 1314 » Reducing the Complexity of Reductions |
220
click to vote
FOCS
2004
IEEE
15 years 11 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
235
click to vote
AAAI
2007
15 years 10 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
230
click to vote
AAAI
2010
15 years 9 months ago
2010
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
179
click to vote
LWA
2007
15 years 9 months ago
2007
Nowadays, launching new products in short intervals is a critical factor for success to persist on the global market. At the same time many enterprises call for cost reduction in ...
189
click to vote
CLA
2004
15 years 9 months ago
2004
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...