2588 search results - page 30 / 518 » Applications of Kolmogorov complexity to computable model th... |
IPPS
2008
IEEE
2008
IEEE
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
15 years 5 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...
JC
2008
14 years 11 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
104
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In recent years the Markov Random Field (MRF) has
become the de facto probabilistic model for low-level vision
applications. However, in a maximum a posteriori
(MAP) framework, ...
VIS
2007
IEEE
16 years 15 days ago
2007
IEEE
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...