2200 search results - page 166 / 440 » Bloch's Constant is Computable |
172
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
174
click to vote
SCALESPACE
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Super-resolution of a single image is a severely ill-posed problem in computer vision. It is possible to consider solving this problem by considering a total variation ba...
154
click to vote
SOFSEM
2007
Springer
16 years 19 days ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
189
click to vote
UIC
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Sensor relocation protocols can be employed as fault tolerance approach to offset the coverage loss caused by node failures. We introduce a novel localized structure, in...
153
click to vote
WG
2007
Springer
16 years 19 days ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...