287 search results - page 10 / 58 » Exact Cover with light |
141
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
114
Voted
ESA
2003
Springer
15 years 8 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
105
Voted
CCCG
2007
15 years 5 months ago
2007
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
119
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
We propose a method of using shape adaptation for compression of light fields of 3-D objects. Shape adaptation is incorporated into two light field coders, both applying disparity...
112
Voted
ICASSP
2007
IEEE
15 years 7 months ago
2007
IEEE
We propose an algorithm to detect depths in a light field. Specifically, given a 4D light field, we find all planes at which objects are located. Although the exact depth of each ...