Sciweavers

1149 search results - page 52 / 230
» Minimally non-Pfaffian graphs
Sort
View
ISLPED
1995
ACM
100views Hardware» more  ISLPED 1995»
15 years 3 months ago
Simultaneous scheduling and binding for power minimization during microarchitecture synthesis
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
Aurobindo Dasgupta, Ramesh Karri
95
Voted
CVPR
2008
IEEE
16 years 1 months ago
Non-negative graph embedding
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
Jianchao Yang, Shuicheng Yan, Yun Fu, Xuelong Li, ...
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 6 months ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
DSD
2003
IEEE
138views Hardware» more  DSD 2003»
15 years 5 months ago
A Two-step Genetic Algorithm for Mapping Task Graphs to a Network on Chip Architecture
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
Tang Lei, Shashi Kumar
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 4 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...