704 search results - page 86 / 141 » Isometrically Embedded Graphs |
GD
1995
Springer
15 years 3 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
137
click to vote
DCOSS
2008
Springer
15 years 1 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
IADIS
2008
15 years 1 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
DAC
2005
ACM
16 years 25 days ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...