4940 search results - page 529 / 988 » On the Complexity of Universal Programs |
185
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
176
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The critical functionality of many software applications relies on code that performs mathematically complex computations. However, such code is often difficult to test owing to t...
177
click to vote
PDCAT
2009
Springer
16 years 1 months ago
2009
Springer
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...
178
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
166
click to vote
ICEIS
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper investigates Grid computing from the point of view three basic computing platforms. The platform consists of virtual compute resources, a programming environment all...