776 search results - page 52 / 156 » Generalized Voxel Coloring |
137
Voted
NETWORKS
2010
15 years 2 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
169
click to vote
CIARP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Recently, we have proposed a novel approach of texture analysis that has overcome most of the state-of-art methods. This method considers independent walkers, with a give...
153
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
134
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Many vision and graphics problems such as relighting,
structured light scanning and photometric stereo, need im-
ages of a scene under a number of different illumination
conditi...
163
click to vote
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...