Sciweavers

Share
138 search results - page 1 / 28
» Hardness of fully dense problems
Sort
View
IANDC
2007
123views more  IANDC 2007»
10 years 4 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
EUROPAR
2011
Springer
9 years 3 months ago
A Fully Empirical Autotuned Dense QR Factorization for Multicore Architectures
: Tuning numerical libraries has become more diļ¬ƒcult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...
Emmanuel Agullo, Jack Dongarra, Rajib Nath, Stanim...
ECCV
2006
Springer
11 years 6 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
LATIN
2010
Springer
10 years 7 months ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
ECCV
2006
Springer
11 years 6 months ago
Dense Photometric Stereo by Expectation Maximization
Abstract. We formulate a robust method using Expectation Maximization (EM) to address the problem of dense photometric stereo. Previous approaches using Markov Random Fields (MRF) ...
Tai-Pang Wu, Chi-Keung Tang
books