684 search results - page 83 / 137 » On embedding well-separable graphs |
181
click to vote
DCOSS
2008
Springer
15 years 5 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...
129
click to vote
IADIS
2008
15 years 5 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 ...
104
click to vote
DAC
2005
ACM
16 years 5 months 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 ...
134
click to vote
ICASSP
2008
IEEE
15 years 10 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...
124
click to vote
ACSD
2006
IEEE
15 years 10 months ago
2006
IEEE
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...