1301 search results - page 86 / 261 » Bounded Version Vectors |
125
Voted
MST
2002
15 years 3 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
128
click to vote
TVLSI
1998
15 years 3 months ago
1998
— Excessive instantaneous power consumption may reduce the reliability and performance of VLSI chips. Hence, to synthesize circuits with high reliability, it is imperative to efï...
137
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
115
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
This paper describes our practical query-by-humming system, SoundCompass, which is being used as a karaoke song selection system in Japan. First, we describe the fundamental techn...
121
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we explore the impact of the block shape on blocked and vectorized versions of the Sparse Matrix-Vector Multiplication (SpMV) kernel and build upon previous work by ...