429 search results - page 63 / 86 » Solving the Maximum Clique Problem Using PUBB |
ACCV
2007
Springer
14 years 1 months ago
2007
Springer
This is a survey paper summarizing recent research aimed at finding guaranteed optimal algorithms for solving problems in Multiview Geometry. Many of the traditional problems in M...
WEA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
MFCS
2009
Springer
14 years 7 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
ESA
2001
Springer
14 years 5 days ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
ICASSP
2007
IEEE
13 years 11 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 ...