9176 search results - page 312 / 1836 » algorithms 2010 |
106
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying
149
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
170
click to vote
CCCG
2010
15 years 8 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
218
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
152
click to vote
CAGD
2010
15 years 6 months ago
2010
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the p...