1420 search results - page 118 / 284 » Representation of Graphs by OBDDs |
149
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
170
Voted
COMBINATORICS
2006
15 years 6 months ago
2006
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
157
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a technique to detect instances of classes (objects) according to their semantic definition in the form of a Description Graph. Classes are defined as combinat...
182
click to vote
ICDM
2007
IEEE
16 years 28 days ago
2007
IEEE
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
156
click to vote
ISMVL
2007
IEEE
16 years 27 days ago
2007
IEEE
Stochastic computation is a new alternative approach for iterative computation on factor graphs. In this approach, the information is represented by the statistics of the bit stre...