6568 search results - page 376 / 1314 » Reducing the Complexity of Reductions |
190
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
197
click to vote
SIAMJO
2000
15 years 7 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
208
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
In this work, two new techniques for non-linear feature extraction are presented. In these techniques, new features are obtained as radial projections of the original measurements...
203
click to vote
STOC
2005
ACM
16 years 8 months ago
2005
ACM
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
184
click to vote
ICCD
2001
IEEE
16 years 4 months ago
2001
IEEE
A new iterative multiplier based on a self-timed clocking scheme is presented. To reduce the area required for the multiplier, only two CSA rows are iteratively used to complete a...