144 search results - page 7 / 29 » Running time and program size for self-assembled squares |
ARCS
2009
Springer
14 years 2 months ago
2009
Springer
In sampling based hotspot detection, performance engineers sample the running program periodically and record the Instruction Pointer (IP) addresses at the sampling. Empirically, f...
MFCS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
IPPS
2008
IEEE
2008
IEEE
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
14 years 1 months ago
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems. Other than using the basic low-rank condition, our method ...
ICALP
2004
Springer
14 years 24 days ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...