Sciweavers

1241 search results - page 79 / 249
» Path-oriented random testing
Sort
View
KDD
1998
ACM
193views Data Mining» more  KDD 1998»
15 years 8 months ago
Methods for Linking and Mining Massive Heterogeneous Databases
Manyreal-world KDDexpeditions involve investigation of relationships betweenvariables in different, heterogeneousdatabases. Wepresent a dynamic programmingtechnique for linking re...
José C. Pinheiro, Don X. Sun
135
Voted
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
15 years 10 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
153
Voted
CORR
2011
Springer
152views Education» more  CORR 2011»
14 years 11 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
FOCS
2008
IEEE
15 years 11 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
134
Voted
IPPS
2007
IEEE
15 years 11 months ago
Achieving Reliable Parallel Performance in a VoD Storage Server Using Randomization and Replication
This paper investigates randomization and replication as strategies to achieve reliable performance in disk arrays targeted for video-on-demand (VoD) workloads. A disk array can p...
Yung Ryn Choe, Vijay S. Pai