| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


21 - 22 / 22
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
21.
Local search engine with global content based on domain specific knowledge
Sandi Pohorec, Mateja Verlič, Milan Zorman, 2009, izvirni znanstveni članek

Opis: In the growing need for information we have come to rely on search engines. The use of large scale search engines, such as Google, is as common as surfingthe World Wide Web. We are impressed with the capabilities of these search engines but still there is a need for improvment. A common problem withsearching is the ambiguity of words. Their meaning often depends on the context in which they are used or varies across specific domains. To resolve this we propose a domain specific search engine that is globally oriented. We intend to provide content classification according to the target domain concepts, access to privileged information, personalization and custom rankingfunctions. Domain specific concepts have been formalized in the form ofontology. The paper describes our approach to a centralized search service for domain specific content. The approach uses automated indexing for various content sources that can be found in the form of a relational database, we! b service, web portal or page, various document formats and other structured or unstructured data. The gathered data is tagged with various approaches and classified against the domain classification. The indexed data is accessible through a highly optimized and personalized search service.
Ključne besede: information search, personalization, indexes, crawling, domain specific crawling, natural language processing, content tagging, distributed data sources, ranking functions
Objavljeno v DKUM: 31.05.2012; Ogledov: 2151; Prenosov: 37
URL Povezava na celotno besedilo

22.
Searching for messages conforming to arbitrary sets of conditions in SHA-256
Marko Hölbl, Christian Rechberger, Tatjana Welzer Družovec, 2008, samostojni znanstveni sestavek ali poglavje v monografski publikaciji

Opis: Recent progress in hash functions analysis has led to collisions on reduced versions of SHA-256. As in other hash functions, differential collision search methods of SHA-256 can be described by means of conditions on and between state and message bits. We describe a tool for efficient automatic searching of message pairs conforming to useful sets of conditions, i. e. stemming from (interleaved) local collisions. We not only considerably improve upon previous work [7], but also show the extendability of our approach to larger sets of conditions. Furthermore, we present the performance results of an actual implementation and pose an open problem in this context.
Ključne besede: hash functions analysis, messages, SHA-256, automatic searching, differential collision search
Objavljeno v DKUM: 31.05.2012; Ogledov: 1723; Prenosov: 99
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.06 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici