557 search results - page 48 / 112 » On the set multi-cover problem in geometric settings |
COMPGEOM
2006
ACM
14 years 3 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...
SYNASC
2008
IEEE
14 years 3 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
SIAMMAX
2010
13 years 3 months ago
2010
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
WSCG
2004
13 years 10 months ago
2004
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
We describe how certain tasks in the audio domain can be effectively addressed using computer vision approaches. This paper focuses on the problem of music identification, where t...