188 search results - page 15 / 38 » When Regions Start to Move |
103
click to vote
CIE
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine has m-counters operating on a one-way input delimited by left a...
110
click to vote
TOG
2002
14 years 11 months ago
2002
Placing shadows is difficult task since shadows depend on the relative positions of lights and objects in an unintuitive manner. To simplify the task of the modeler, we present a ...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
116
click to vote
FUN
2010
Springer
15 years 4 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
DICTA
2003
15 years 1 months ago
2003
Abstract. This paper describes methods of extracting region boundaries from the frames of an image sequence by combining information from spatial or temporal cooccurrence matrices ...