Sciweavers

1127 search results - page 31 / 226
» Value Compression for Efficient Computation
Sort
View
JSC
2008
162views more  JSC 2008»
14 years 9 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
73
Voted
ICAC
2007
IEEE
15 years 4 months ago
Adaptive Multi-levels Dictionaries and Singular Value Decomposition Techniques for Autonomic Problem Determination
An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose su...
Hoi Chan, Thomas Kwok
CG
2010
Springer
14 years 7 months ago
Biasing Monte-Carlo Simulations through RAVE Values
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
Arpad Rimmel, Fabien Teytaud, Olivier Teytaud
DEBS
2010
ACM
14 years 4 months ago
Distributed structural and value XML filtering
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
Iris Miliaraki, Manolis Koubarakis
FCCM
1999
IEEE
134views VLSI» more  FCCM 1999»
15 years 1 months ago
Runlength Compression Techniques for FPGA Configurations
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
Scott Hauck, William D. Wilson