6682 search results - page 1091 / 1337 » networks 2006 |
177
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. Streaming environments typically dictate incomplete or approximate algorithm execution, in order to cope with sudden surges in the data rate. Such limitations are even mo...
176
click to vote
ICCAD
2006
IEEE
16 years 4 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
157
click to vote
ICCAD
2006
IEEE
16 years 4 months ago
2006
IEEE
We devise a central triangular sequence to minimize the escape routing layers in area array packaging. We use a network flow model to analyze the bottleneck of the routable pins. ...
181
click to vote
ICCAD
2006
IEEE
16 years 4 months ago
2006
IEEE
We present a fast and efficient combinatorial algorithm to simultaneously identify the candidate locations as well as the sizes of the buffers driving a clock mesh. Due to the hi...
185
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Recent studies in speaker recognition have shown that scorelevel combination of subsystems can yield significant performance gains over individual subsystems. We explore the use ...