104 search results - page 14 / 21 » On the Complexity of Some Colorful Problems Parameterized by... |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
ICIP
2007
IEEE
14 years 1 months ago
2007
IEEE
Image Cube Trajectory (ICT) analysis is a new and robust method to estimate the 3D structure of a scene from a set of 2D images. For a moving camera each 3D point is represented b...
SIGGRAPH
1998
ACM
13 years 11 months ago
1998
ACM
We investigate the general problem of reproducing color images on an offset press using custom inks in any combination and number. While this problem has been explored previously ...
ECOOP
2006
Springer
13 years 11 months ago
2006
Springer
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...