Search (160 results, page 2 of 8)

  • × year_i:[2000 TO 2010}
  • × theme_ss:"Retrievalalgorithmen"
  1. Okada, M.; Ando, K.; Lee, S.S.; Hayashi, Y.; Aoe, J.I.: ¬An efficient substring search method by using delayed keyword extraction (2001) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  2. Kulyukin, V.A.; Settle, A.: Ranked retrieval with semantic networks and vector spaces (2001) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  3. Ponte, J.M.: Language models for relevance feedback (2000) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  4. Ding, Y.; Chowdhury, G.; Foo, S.: Organsising keywords in a Web search environment : a methodology based on co-word analysis (2000) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  5. Bodoff, D.; Enache, D.; Kambil, A.; Simon, G.; Yukhimets, A.: ¬A unified maximum likelihood approach to document retrieval (2001) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  6. Clarke, C.L.A.; Cormack, G.V.; Tudhope, E.A.: Relevance ranking for one to three term queries (2000) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  7. Boughanem, M.; Chrisment, C.; Tamine, L.: On using genetic algorithms for multimodal relevance optimization in information retrieval (2002) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  8. Weinstein, A.: Hochprozentig : Tipps and tricks für ein Top-Ranking (2002) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  9. Losada, D.E.; Barreiro, A.: Emebedding term similarity and inverse document frequency into a logical model of information retrieval (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  10. Nie, J.-Y.: Query expansion and query translation as logical inference (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  11. Picard, J.; Savoy, J.: Enhancing retrieval with hyperlinks : a general model based on propositional argumentation systems (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  12. Song, D.; Bruza, P.D.: Towards context sensitive information inference (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  13. Crestani, F.; Dominich, S.; Lalmas, M.; Rijsbergen, C.J.K. van: Mathematical, logical, and formal methods in information retrieval : an introduction to the special issue (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  14. Chen, H.; Lally, A.M.; Zhu, B.; Chau, M.: HelpfulMed : Intelligent searching for medical information over the Internet (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  15. Heinz, S.; Zobel, J.: Efficient single-pass index construction for text databases (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  16. Mandl, T.: Web- und Multimedia-Dokumente : Neuere Entwicklungen bei der Evaluierung von Information Retrieval Systemen (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  17. Bodoff, D.; Robertson, S.: ¬A new unified probabilistic model (2004) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  18. Oberhauser, O.; Labner, J.: Relevance Ranking in Online-Katalogen : Informationsstand und Perspektiven (2003) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  19. Fan, W.; Fox, E.A.; Pathak, P.; Wu, H.: ¬The effects of fitness functions an genetic programming-based ranking discovery for Web search (2004) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    
  20. Silveira, M.; Ribeiro-Neto, B.: Concept-based ranking : a case study in the juridical domain (2004) 1.00
    1.0 = *:*, product of:
      1.0 = boost
      1.0 = queryNorm
    

Languages

  • e 138
  • d 19
  • m 1
  • pt 1
  • sp 1
  • More… Less…

Types

  • a 143
  • m 8
  • x 6
  • el 3
  • s 2
  • r 1
  • More… Less…