13603 search results - page 92 / 2721 » On the Computational Complexity of Cut-Reduction |
165
click to vote
EUROPAR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Active Storage provides an opportunity for reducing the bandwidth requirements between the storage and compute elements of current supercomputing systems, and leveraging ...
157
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
200
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
This paper presents an efficient method to compute the maximum likelihood (ML) estimation of the parameters of a complex 2-D sinusoidal, with the complexity order of the FFT. The...
152
click to vote
COMPGEOM
2008
ACM
15 years 7 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
202
click to vote
ECCV
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents a probabilistic grammar approach to the recognition of complex events in videos. Firstly, based on the original motion features, a rule induction algorithm is a...