328 search results - page 49 / 66 » Algorithms for the edge-width of an embedded graph |
146
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
74
Voted
RTCSA
2006
IEEE
15 years 3 months ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
DATE
2003
IEEE
15 years 2 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
SCALESPACE
2005
Springer
15 years 3 months ago
2005
Springer
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
IJCAI
1989
14 years 10 months ago
1989
In this paper, we present QUALEX, a system and algorithm for generating first-order qualitative causal graphs for tutorial purposes based on de Kleer and Brown's qualitative ...