5100 search results - page 383 / 1020 » The Linear Complexity of a Graph |
149
click to vote
GD
2009
Springer
16 years 2 days ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
191
Voted
ISVC
2009
Springer
16 years 1 days 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...
187
click to vote
FUZZY
2001
Springer
15 years 12 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...
177
click to vote
SAS
1999
Springer
15 years 11 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...
170
Voted
AGENTS
1997
Springer
15 years 11 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...