Sciweavers

696 search results - page 118 / 140
» A class of combinatorial identities
Sort
View
COLT
1998
Springer
15 years 6 months ago
Improved Boosting Algorithms using Confidence-Rated Predictions
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
Robert E. Schapire, Yoram Singer
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 6 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
DOOD
1989
Springer
146views Database» more  DOOD 1989»
15 years 6 months ago
The Object-Oriented Database System Manifesto
This paper attempts to de ne an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented databas...
Malcolm P. Atkinson, François Bancilhon, Da...
ICC
2007
IEEE
114views Communications» more  ICC 2007»
15 years 5 months ago
Channel-Matched Spreading Codes for the Downlink of MC-CDMA
Abstract-- This paper concerns the multiple access performance of spreading codes used in the downlink of multicarrier code-division multiple-access (MC-CDMA). Complex-valued sprea...
Qinghua Shi, Yong Liang Guan, Choi Look Law
LCPC
2000
Springer
15 years 5 months ago
Recursion Unrolling for Divide and Conquer Programs
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce c...
Radu Rugina, Martin C. Rinard