1672 search results - page 14 / 335 » Tightness problems in the plane |
162
click to vote
ECCV
2000
Springer
16 years 7 months ago
2000
Springer
Abstract. We study the special form that the general multi-image tensor formalism takes under the plane + parallax decomposition, including matching tensors and constraints, closur...
251
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
129
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
189
click to vote
MMB
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
183
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...