6568 search results - page 111 / 1314 » Reducing the Complexity of Reductions |
267
click to vote
STOC
2012
ACM
13 years 10 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
233
click to vote
CIKM
2011
Springer
14 years 7 months ago
2011
Springer
The effectiveness and scalability of MapReduce-based implementations of complex data-intensive tasks depend on an even redistribution of data between map and reduce tasks. In the...
202
click to vote
ACISP
2010
Springer
15 years 5 months ago
2010
Springer
Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-...
187
click to vote
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...
201
click to vote
ESANN
2004
15 years 9 months ago
2004
The way information is represented and processed in a neural network may have important consequences on its computational power and complexity. Basically, information representatio...