10493 search results - page 2010 / 2099 » Dynamic Word Problems |
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Publication
With increasingly widespread use of computer networks, and the use of varied technology for the interconnection of computers, congestion is a significant problem. In this report, w...
117
click to vote
Tutorial
The last decade has seen a tremendous interest in gradient domain manipulation techniques for applications in vision and graphics including retinex, high dynamic range (HDR) tone m...
CVPR
2001
IEEE
14 years 10 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Ga...