共 50 条
- [1] A Bayesian spatiotemporal model for very large data sets [J]. NEUROIMAGE, 2010, 50 (03) : 1126 - 1141
- [3] An Efficient Motif Finding Algorithm for Large DNA Data Sets [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2014,
- [4] Finding hidden independent sets in interval graphs [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2003, 2697 : 182 - +
- [6] From searching to finding: New developments for managing large data sets [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2014, 247
- [7] Inapproximability of finding maximum hidden sets on polygons and terrains [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 21 (03): : 139 - 153
- [9] Finding a large hidden clique in a random graph [J]. RANDOM STRUCTURES & ALGORITHMS, 1998, 13 (3-4) : 457 - 466
- [10] Hidden Data Sets, an Untapped Resource [J]. MODSIM 2005: INTERNATIONAL CONGRESS ON MODELLING AND SIMULATION: ADVANCES AND APPLICATIONS FOR MANAGEMENT AND DECISION MAKING: ADVANCES AND APPLICATIONS FOR MANAGEMENT AND DECISION MAKING, 2005, : 2832 - 2837