10988 search results - page 519 / 2198 » Algorithmic Folding Complexity |
299
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
185
click to vote
AICCSA
2006
IEEE
16 years 1 months ago
2006
IEEE
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
191
click to vote
ICMCS
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper proposes a condition-based algorithm for H.264/AVC 4x4 intra prediction. Exploiting high correlation existed in neighboring intra prediction modes, we propose the three...
185
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
202
click to vote
PPOPP
2005
ACM
16 years 19 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...