1170 search results - page 102 / 234 » How Fast Is Too Fast |
114
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
102
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We examined how much listeners can benefit from listening to “clear” (CLR) speech compared to “conversational” (CNV) speech, both spoken at different speaking rates. Vowe...
107
click to vote
COMPSAC
2006
IEEE
15 years 9 months ago
2006
IEEE
Model-checking techniques are successfully used in the verification of both hardware and software systems of industrial relevance. Unfortunately, the capability of current techni...
115
click to vote
RTCSA
2005
IEEE
15 years 8 months ago
2005
IEEE
While enabling fast implementation and reconfiguration of stream applications, programmable stream processors expose issues of incompatibility and lack of adoption in existing st...
104
click to vote
ATAL
2000
Springer
15 years 7 months ago
2000
Springer
Agents often have preference models that are more complicated than minimizing the expected execution cost. In this paper, we study how they should act in the presence of uncertaint...