Sciweavers

197 search results - page 9 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
SOFSEM
2009
Springer
14 years 4 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
ICDCS
2006
IEEE
14 years 1 months ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
ITC
2002
IEEE
72views Hardware» more  ITC 2002»
14 years 8 days ago
Test Point Insertion that Facilitates ATPG in Reducing Test Time and Data Volume
Efficient production testing is frequently hampered because current digital circuits require test sets which are too large. These test sets can be reduced significantly by means...
M. J. Geuzebroek, J. Th. van der Linden, A. J. van...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 7 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
ISCA
1998
IEEE
144views Hardware» more  ISCA 1998»
13 years 11 months ago
Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism
This paper investigates the placement of data and parity on redundant disk arrays. Declustered organizations have been traditionally used to achieve fast reconstruction of a faile...
Guillermo A. Alvarez, Walter A. Burkhard, Larry J....