Sciweavers

828 search results - page 14 / 166
» Simplicial Powers of Graphs
Sort
View
DATE
2003
IEEE
102views Hardware» more  DATE 2003»
14 years 1 months ago
Power Constrained High-Level Synthesis of Battery Powered Digital Systems
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...
S. F. Nielsen, Jan Madsen
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 1 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
DM
2006
92views more  DM 2006»
13 years 8 months ago
Sums of powers of the degrees of a graph
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
Sebastian M. Cioaba
SIAMDM
2010
114views more  SIAMDM 2010»
13 years 7 months ago
Rank-Based Attachment Leads to Power Law Graphs
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
Jeannette Janssen, Pawel Pralat
ISM
2006
IEEE
122views Multimedia» more  ISM 2006»
14 years 2 months ago
SuperGraph Visualization
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
José Fernando Rodrigues Jr., Agma J. M. Tra...