2612 search results - page 200 / 523 » Switching Graphs and Their Complexity |
130
click to vote
ISVC
2009
Springer
15 years 9 months ago
2009
Springer
The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of interest from the points of other, unwanted objects. Thi...
137
click to vote
FUZZY
2001
Springer
15 years 9 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
122
click to vote
SAS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
126
click to vote
AGENTS
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We present a purely vision-based scheme for learning a topological representation of an open environment. The system represents selected places by local views of the surr...
133
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...