2450 search results - page 262 / 490 » Time Mapping with Hypergraphs |
141
Voted
GLVLSI
2010
IEEE
15 years 4 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
127
Voted
ALGORITHMICA
2007
15 years 3 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
115
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
196
Voted
MOBILIGHT
2010
15 years 1 months ago
2010
Abstract. This paper describes a framework for the design space exploration of resource-efficient software-defined radio architectures. This design space exploration is based on a ...
127
Voted
ICMLA
2009
15 years 1 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...