Sciweavers

443 search results - page 1 / 89
» More on the Size of Higman-Haines Sets: Effective Constructi...
Sort
View
MCU
2007
74views Hardware» more  MCU 2007»
13 years 6 months ago
More on the Size of Higman-Haines Sets: Effective Constructions
Hermann Gruber, Markus Holzer, Martin Kutrib
ASPLOS
1987
ACM
13 years 8 months ago
The Effect of Instruction Set Complexity on Program Size and Memory Performance
One potentialdisadvantage of a machine with a reduced instruction. set is that object programs may be substantially larger than those for a machine with a richer, more complex ins...
Jack W. Davidson, Richard A. Vaughan
WWW
2005
ACM
14 years 5 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...
DCC
2005
IEEE
14 years 4 months ago
On the Existence of Large Sets of t-designs of Prime Sizes
In this paper, we employ the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive ...
Behruz Tayfeh-Rezaie
RSA
2008
63views more  RSA 2008»
13 years 4 months ago
On the size of the algebraic difference of two random Cantor sets
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one ...
Michel Dekking, Károly Simon