1170 search results - page 108 / 234 » How Fast Is Too Fast |
144
click to vote
PUK
2000
15 years 4 months ago
2000
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
116
click to vote
AIPS
2009
15 years 4 months ago
2009
Planning systems for real-world applications need the ability to handle concurrency and numeric fluents. Nevertheless, the predominant approach to cope with concurrency followed b...
132
click to vote
GBRPR
2009
Springer
15 years 9 months ago
2009
Springer
This article shows how the interactive segmentation tool termed “Active Paintbrush” and a fully automatic region merging can both be based on the theoretical framework of contr...
115
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
136
click to vote
CHES
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper discusses the state-of-the-art fast software implementation of block ciphers on Intel’s new microprocessor Core2, particularly concentrating on “bitslice i...