6568 search results - page 310 / 1314 » Reducing the Complexity of Reductions |
167
click to vote
APCSAC
2003
IEEE
15 years 10 months ago
2003
IEEE
Very Long Instruction Word (VLIW) architectures exploit instruction level parallelism (ILP) with the help of the compiler to achieve higher instruction throughput with minimal hard...
204
click to vote
AUSDM
2008
Springer
15 years 8 months ago
2008
Springer
Data mining and knowledge discovery have been applied to datasets in various industries including biomedical data. Modelling, data mining and visualization in biomedical data addr...
179
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
198
Voted
ICTCS
2005
Springer
16 years 10 days ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
190
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...