메뉴 건너뛰기




Volumn , Issue , 2010, Pages 986-993

Generalized Task Markets for Human and Machine Computation

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; COMPUTER AIDED LANGUAGE TRANSLATION; LEARNING SYSTEMS; MACHINE COMPONENTS;

EID: 84858186316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (37)

References (13)
  • 2
    • 84858011453 scopus 로고    scopus 로고
    • Discriminative, syntactic language modeling through latent svms
    • Cherry, C., and Quirk, C. 2008. Discriminative, syntactic language modeling through latent svms. In AMTA'08.
    • (2008) AMTA'08
    • Cherry, C.1    Quirk, C.2
  • 3
    • 33748101042 scopus 로고    scopus 로고
    • On maximizing welfare when utility functions are subadditive
    • Feige, U. 2006. On maximizing welfare when utility functions are subadditive. In STOC'06.
    • (2006) STOC'06
    • Feige, U.1
  • 4
    • 33847314216 scopus 로고    scopus 로고
    • Complementary computing: Policies for transferring callers from dialog systems to human receptionists
    • Horvitz, E., and Paek, T. 2007. Complementary computing: Policies for transferring callers from dialog systems to human receptionists. User Modeling and User Adapted Interaction.
    • (2007) User Modeling and User Adapted Interaction
    • Horvitz, E.1    Paek, T.2
  • 5
    • 34447264584 scopus 로고    scopus 로고
    • Reflections on challenges and promises of mixed-initiative interaction
    • Horvitz, E. 2007. Reflections on challenges and promises of mixed-initiative interaction. AI Magazine 28(2).
    • (2007) AI Magazine , vol.28 , Issue.2
    • Horvitz, E.1
  • 7
    • 79959757768 scopus 로고    scopus 로고
    • Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
    • ACM
    • Mirrokni, V.; Schapira, M.; and Vondrak, J. 2008. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In EC'08. ACM.
    • (2008) EC'08
    • Mirrokni, V.1    Schapira, M.2    Vondrak, J.3
  • 8
    • 0000095809 scopus 로고
    • An analysis of approximations for maximizing submodular set functions I
    • Nemhauser, G. L.; Wolsey, L. A.; and Fisher, M. L. 1978. An analysis of approximations for maximizing submodular set functions I. Mathematical Programming 14(1).
    • (1978) Mathematical Programming , vol.14 , Issue.1
    • Nemhauser, G. L.1    Wolsey, L. A.2    Fisher, M. L.3
  • 10
    • 0000356016 scopus 로고
    • Task allocation via coalition formation among autonomous agents
    • Shehory, O., and Kraus, S. 1995. Task allocation via coalition formation among autonomous agents. In IJCAI'95.
    • (1995) IJCAI'95
    • Shehory, O.1    Kraus, S.2
  • 11
    • 4544353199 scopus 로고    scopus 로고
    • Labeling images with a computer game
    • von Ahn, L., and Dabbish, L. 2004. Labeling images with a computer game. In CHI.
    • (2004) CHI
    • von Ahn, L.1    Dabbish, L.2
  • 12
    • 52649093789 scopus 로고    scopus 로고
    • Human computation
    • IEEE
    • von Ahn, L. 2008. Human computation. In ICDE. IEEE.
    • (2008) ICDE
    • von Ahn, L.1
  • 13
    • 57049187237 scopus 로고    scopus 로고
    • Optimal approximation for the submodular welfare problem in the value oracle model
    • Vondrak, J. 2008. Optimal approximation for the submodular welfare problem in the value oracle model. In STOC'08.
    • (2008) STOC'08
    • Vondrak, J.1


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