Sciweavers

3757 search results - page 574 / 752
» The overlap number of a graph
Sort
View
ICALP
2000
Springer
15 years 10 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
DAC
1995
ACM
15 years 10 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
ICS
1995
Tsinghua U.
15 years 10 months ago
Gated SSA-based Demand-Driven Symbolic Analysis for Parallelizing Compilers
In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency...
Peng Tu, David A. Padua
ISLPED
1995
ACM
85views Hardware» more  ISLPED 1995»
15 years 10 months ago
Estimation of energy consumption in speed-independent control circuits
Abstract: We describe a technique to estimate the energy consumed by speed-independent asynchronous (clockless) control circuits. Because speed-independent circuits are hazard-free...
Peter A. Beerel, Cheng-Ta Hsieh, Suhrid A. Wadekar
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 10 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein