328 search results - page 32 / 66 » Algorithms for the edge-width of an embedded graph |
124
click to vote
EURODAC
1995
IEEE
15 years 3 months ago
1995
IEEE
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
111
click to vote
CODES
2001
IEEE
15 years 3 months ago
2001
IEEE
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
GD
2003
Springer
15 years 5 months ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
106
click to vote
IJCV
2006
14 years 11 months ago
2006
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...