메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1059-1063

Group testing and sparse signal recovery

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC PROBLEMS; DESIGN PROBLEMS; EFFICIENT ALGORITHM; EFFICIENT SETS; EXPERIMENTAL DESIGN; FUNCTION LEARNING; GROUP TESTING; PUBLIC HEALTH; SPARSE SIGNALS; STATISTICAL QUANTITY; STREAMING DATA; TEST RESULTS; WEIGHING PROBLEM; WORLD WAR II;

EID: 70349696280     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2008.5074574     Document Type: Conference Paper
Times cited : (111)

References (13)
  • 1
    • 57949113508 scopus 로고    scopus 로고
    • Combining geometry and combinatorics: A unified approach to sparse signal recovery
    • preprint
    • R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, and M. Strauss. Combining geometry and combinatorics: A unified approach to sparse signal recovery. preprint, 2008.
    • (2008)
    • Berinde, R.1    Gilbert, A.C.2    Indyk, P.3    Karloff, H.4    Strauss, M.5
  • 2
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • E. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory, 52:489-509, 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , pp. 489-509
    • Candes, E.1    Romberg, J.2    Tao, T.3
  • 5
    • 0001243071 scopus 로고
    • The detection of defective members of large populations
    • R. Dorfman. The detection of defective members of large populations. Ann. Math. Stat., 1943.
    • (1943) Ann. Math. Stat
    • Dorfman, R.1
  • 7
    • 30844452004 scopus 로고    scopus 로고
    • Improved time bounds for near-optimal sparse Fourier representations
    • A. Gilbert, S. Muthukrishnan, and M. Strauss. Improved time bounds for near-optimal sparse Fourier representations. SPIE, 2005.
    • (2005) SPIE
    • Gilbert, A.1    Muthukrishnan, S.2    Strauss, M.3
  • 9
    • 78650759634 scopus 로고    scopus 로고
    • A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods
    • M. A. Iwen. A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods. In SODA, 2008.
    • (2008) SODA
    • Iwen, M.A.1
  • 11
    • 0029292087 scopus 로고
    • Randomized approxmation and interpolation of sparse polynomials
    • Y. Mansour. Randomized approxmation and interpolation of sparse polynomials. SIAM Journal on Computing, 24:2, 1995.
    • (1995) SIAM Journal on Computing , vol.24 , pp. 2
    • Mansour, Y.1
  • 13
    • 70349677520 scopus 로고    scopus 로고
    • Explicit non-adaptive combinatorial group testing schemes
    • E. Porat and A. Rothschild. Explicit non-adaptive combinatorial group testing schemes. ICALP, 2008.
    • (2008) ICALP
    • Porat, E.1    Rothschild, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.