3405 search results - page 252 / 681 » Factoring Groups Efficiently |
152
click to vote
FPGA
1999
ACM
15 years 11 months ago
1999
ACM
One of the major overheads in reconfigurable computing is the time it takes to reconfigure the devices in the system. The configuration compression algorithm presented in our prev...
173
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
112
click to vote
BCSHCI
2007
15 years 8 months ago
2007
Personalization of a self-services kiosk or ATM may provide the user with an efficient means of obtaining new appropriate services with the degree of immediate gratification consu...
131
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
187
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
In the numerical solution of large-scale eigenvalue problems, Davidson-type methods are an increasingly popular alternative to Krylov eigensolvers. The main motivation is to avoid ...