138 search results - page 1 / 28 » Hardness of fully dense problems |
IANDC
2007
13 years 10 months ago
2007
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...
EUROPAR
2011
Springer
12 years 10 months ago
2011
Springer
: Tuning numerical libraries has become more difficult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...
ECCV
2006
Springer
15 years 24 days ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
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...
ECCV
2006
Springer
15 years 24 days ago
2006
Springer
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) ...