Sciweavers

1763 search results - page 42 / 353
» Dependent random choice
Sort
View
MICS
2010
134views more  MICS 2010»
13 years 7 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
ICASSP
2011
IEEE
13 years 24 days ago
Combined compressed sensing and parallel mri compared for uniform and random cartesian undersampling of K-space
Both compressed sensing (CS) and parallel imaging effectively reconstruct magnetic resonance images from undersampled data. Combining both methods enables imaging with greater und...
Daniel S. Weller, Jonathan R. Polimeni, Leo Grady,...
ICSE
2010
IEEE-ACM
14 years 1 months ago
Is operator-based mutant selection superior to random mutant selection?
Due to the expensiveness of compiling and executing a large number of mutants, it is usually necessary to select a subset of mutants to substitute the whole set of generated mutan...
Lu Zhang, Shan-Shan Hou, Jun-Jue Hu, Tao Xie, Hong...
ACTA
2008
88views more  ACTA 2008»
13 years 7 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
KBSE
2008
IEEE
14 years 3 months ago
Random Test Run Length and Effectiveness
Abstract—A poorly understood but important factor in random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear wheth...
James H. Andrews, Alex Groce, Melissa Weston, Ru-G...