5595 search results - page 881 / 1119 » Comparing Subsumption Optimizations |
198
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
143
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
-- In this paper, a tool to aid pipelined processor instruction set implementation is described. The purpose of the tool is to choose from among design alternatives a design that m...
194
click to vote
ASPLOS
1992
ACM
15 years 10 months ago
1992
ACM
Software-controlled data prefetching is a promising technique for improving the performance of the memory subsystem to match today's high-performance processors. While prefet...
151
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Tweakable blockciphers, first formalized by Liskov, Rivest, and Wagner [13], are blockciphers with an additional input, the tweak, which allows for variability. An open p...
174
Voted
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...