19866 search results - page 293 / 3974 » Computing all factorizations in *** |
210
click to vote
SCIA
2009
Springer
16 years 1 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
182
click to vote
IMC
2009
ACM
16 years 1 months ago
2009
ACM
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
163
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
159
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Stencil computations form the performance-critical core of many applications. Tiling and parallelization are two important optimizations to speed up stencil computations. Many til...
189
click to vote
ICPADS
2006
IEEE
16 years 22 days ago
2006
IEEE
—Recently, high-end reconfigurable computing systems that employ Field-Programmable Gate Arrays (FPGAs) as hardware accelerators for general-purpose processors have been built. T...