메뉴 건너뛰기




Volumn 371, Issue 3, 2007, Pages 148-154

Approximately dominating representatives

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; COMPUTATION THEORY; FUNCTION EVALUATION; FUZZY SETS; PARETO PRINCIPLE; POLYNOMIALS;

EID: 33846817057     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.11.003     Document Type: Article
Times cited : (62)

References (16)
  • 1
    • 33846809550 scopus 로고    scopus 로고
    • Wolf-Tilo Balke, Ulrich Güntzer, Jason Xin Zheng, Efficient distributed skylining for web information systems, in: EDBT, 2004
  • 2
  • 5
    • 33846848177 scopus 로고    scopus 로고
    • Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Mehrotra, Refining top-k selection queries based on user feedback, in: VLDB, 2000
  • 6
    • 33846841254 scopus 로고    scopus 로고
    • Kenneth L. Clarkson, Kasturi Varadarajan, Improved approximation algorithms for geometric set cover, in: SoCG 2005 (in press)
  • 7
    • 0031635768 scopus 로고    scopus 로고
    • Ronald Fagin, Fuzzy queries in multimedia database systems, in: PODS, 1998, pp. 1-10, invited
  • 8
    • 0034819889 scopus 로고    scopus 로고
    • Ronald Fagin, Amnon Lotem, Moni Naor, Optimal aggregation algorithms for middleware, in: PODS, 2001
  • 9
    • 0033075316 scopus 로고    scopus 로고
    • Combining fuzzy information from multiple systems
    • Fagin R. Combining fuzzy information from multiple systems. Journal of Computer and System Sciences 58 1 (1999) 83-99
    • (1999) Journal of Computer and System Sciences , vol.58 , Issue.1 , pp. 83-99
    • Fagin, R.1
  • 10
    • 0001385606 scopus 로고    scopus 로고
    • A formula for incorporating weights into scoring rules
    • Fagin R., and Wimmers E.L. A formula for incorporating weights into scoring rules. Theoretical Computer Science 239 2 (2000) 309-338
    • (2000) Theoretical Computer Science , vol.239 , Issue.2 , pp. 309-338
    • Fagin, R.1    Wimmers, E.L.2
  • 11
    • 0028514351 scopus 로고
    • On the hardness of approximating minimization problems
    • Lund C., and Yannakakis M. On the hardness of approximating minimization problems. Journal of the ACM 41 5 (1994) 960-981
    • (1994) Journal of the ACM , vol.41 , Issue.5 , pp. 960-981
    • Lund, C.1    Yannakakis, M.2
  • 12
    • 0034503926 scopus 로고    scopus 로고
    • Christos H. Papadimitriou, Mihalis Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: FOCS, 2000, pp. 86-92
  • 13
    • 0034819887 scopus 로고    scopus 로고
    • Christos H. Papadimitriou, Mihalis Yannakakis, Multiobjective query optimization, in: PODS, 2001
  • 14
    • 0344756892 scopus 로고    scopus 로고
    • Kian-Lee Tan, Pin-Kwang Eng, Beng Chin Ooi, Efficient progressive skyline computation, in: VLDB, 2001, pp. 301-310
  • 15
    • 33646728577 scopus 로고    scopus 로고
    • Sergei Vassilvitskii, Mihalis Yannakakis, Efficiently computing succinct trade-off curves, in: ICALP, 2004, pp. 1201-1213


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