2297 search results - page 272 / 460 » An Algorithm for Computing the Integral Closure |
170
Voted
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
136
click to vote
MOBICOM
2004
ACM
15 years 10 months ago
2004
ACM
—The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth allocation among users. We argue that the load ...
188
click to vote
CODES
2003
IEEE
15 years 10 months ago
2003
IEEE
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
127
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
We present a set of techniques for placement-coupled, timingdriven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timingdrive...
139
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...