539 search results - page 84 / 108 » An Improved Upper Bound for SAT |
171
Voted
IDA
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. We apply sparse, fast and flexible adaptive lapped orthogonal transforms to underdetermined audio source separation using the time-frequency masking framework. This norm...
184
click to vote
ICDCS
2008
IEEE
16 years 16 days ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
163
click to vote
CC
2004
Springer
15 years 11 months ago
2004
Springer
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...
146
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
164
click to vote
GLVLSI
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...