Sciweavers

1933 search results - page 158 / 387
» High-performance computing using accelerators
Sort
View
75
Voted
JSAT
2008
85views more  JSAT 2008»
14 years 10 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
91
Voted
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
15 years 3 months ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
78
Voted
DAC
2005
ACM
15 years 11 months ago
Analysis of full-wave conductor system impedance over substrate using novel integration techniques
An efficient approach to full-wave impedance extraction is developed that accounts for substrate effects through the use of two-layer media Green's functions in a mixed-poten...
Xin Hu, Jung Hoon Lee, Jacob White, Luca Daniel
107
Voted
ICA
2004
Springer
15 years 3 months ago
ICA Using Kernel Entropy Estimation with NlogN Complexity
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
Sarit Shwartz, Michael Zibulevsky, Yoav Y. Schechn...
122
Voted
NIPS
2008
14 years 11 months ago
QUIC-SVD: Fast SVD Using Cosine Trees
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
Michael P. Holmes, Alexander G. Gray, Charles Lee ...