Sciweavers

1363 search results - page 208 / 273
» The road coloring problem
Sort
View
TOG
2002
162views more  TOG 2002»
14 years 11 months ago
Jigsaw image mosaics
This paper introduces a new kind of mosaic, called Jigsaw Image Mosaic (JIM), where image tiles of arbitrary shape are used to compose the final picture. The generation of a Jigsa...
Junhwan Kim, Fabio Pellacini
MFCS
2010
Springer
14 years 10 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich
TIT
2011
131views more  TIT 2011»
14 years 6 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
TSP
2010
14 years 6 months ago
Code design for radar STAP via optimization theory
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
CVPR
2008
IEEE
16 years 1 months ago
Multi-object shape estimation and tracking from silhouette cues
This paper deals with the 3D shape estimation from silhouette cues of multiple moving objects in general indoor or outdoor 3D scenes with potential static obstacles, using multipl...
Li Guan, Jean-Sébastien Franco, Marc Pollef...