219 search results - page 5 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
148
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
139
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
133
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In a slow fading MIMO channel, we consider a coded modulation scheme where the inner code is the Golden Code. In this case, a lower bound for the minimum determinant is given by th...
145
Voted
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
125
Voted
ICASSP
2008
IEEE
15 years 12 months ago
2008
IEEE
This paper derives the Cramer-Rao lower bound (CRLB) on estimates of the frequency of a coherent pulse-train passively intercepted at a moving antenna. Such estimates are used to ...