Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Richard H. Fowler"'
Publikováno v:
Journal of the American Society for Information Science and Technology. 52:655-665
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b4d3e8063040350a4af74f59b574d2c
https://doi.org/10.1002/asi.1115
https://doi.org/10.1002/asi.1115
Publikováno v:
Knowledge and Information Systems. 1:369-375
In this paper we study the problem of searching the Web with online learning algorithms. We consider that Web documents can be represented by vectors of n boolean attributes. A search engine is viewed as a learner, and a user is viewed as a teacher.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13ee2056f152d07fe35c416c67c07227
https://doi.org/10.1007/bf03325104
https://doi.org/10.1007/bf03325104
Publikováno v:
Journal of Network and Computer Applications. 20:135-149
Visualization is a promising technique for both enhancing users' perception of structure in the Internet and providing navigation facilities for its large information spaces. This paper describes an application of the Document Explorer to the visuali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd079d6daa5292bfa3a6613faa738c54
https://doi.org/10.1006/jnca.1997.0042
https://doi.org/10.1006/jnca.1997.0042
Publikováno v:
FIE
This paper presents a project in experiential learning where students put knowledge of software engineering processes into action in a multidisciplinary project combining computer science and biology. Visualization serves as a primary element to bind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ad4f2c369d5df26b1f3027d01d9d84d
https://doi.org/10.1109/fie.2013.6684847
https://doi.org/10.1109/fie.2013.6684847
A maximal forward reference of a Web user is a longest consecutive sequence of Web pages visited by the user in a session without revisiting some previously visited page in the sequence. Efficient mining of frequent traversal path patterns, that is,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4abd5e45f6c51df929c452223d265214
https://doi.org/10.4018/978-1-59140-414-9.ch015
https://doi.org/10.4018/978-1-59140-414-9.ch015
Publikováno v:
Algorithmic Aspects in Information and Management ISBN: 9783642021572
AAIM
AAIM
In this paper, we study several versions of optimization problems related to haplotype reconstruction/identification. The input to the first problem is a set C 1 of haplotypes, a set C 2 of haplotypes, and a set G of genotypes. The objective is to se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc39f9ddad8faf198e359905a434d39e
https://doi.org/10.1007/978-3-642-02158-9_3
https://doi.org/10.1007/978-3-642-02158-9_3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540369257
COCOON
COCOON
In this paper we present several lower bounds on the approximation of the exemplar conserved interval distance problem of genomes. We first prove that the exemplar conserved interval distance problem cannot be approximated within a factor of clogn fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cccd52f5ef8598ab7e9b347fb4b68693
https://doi.org/10.1007/11809678_27
https://doi.org/10.1007/11809678_27
Publikováno v:
CBMS
Results of research in public health highly depend on the validity of data collection and internal research processes. To ensure validity, maintaining records of all assets in the research is very important. Researchers should be able to diagnose pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a6c9f2f608a71905d01862d1f1df118
https://doi.org/10.1109/cbms.2006.79
https://doi.org/10.1109/cbms.2006.79
Publikováno v:
ITCC
In this paper, two algorithms are designed for finding maximal forward references from very large Web logs, longest sequences of Web pages visited by a user without revisiting some previously visited page in the sequence, and their performance is com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b4d6ecf23f0323f21168f68c4bf6eba
https://doi.org/10.1109/itcc.2003.1197519
https://doi.org/10.1109/itcc.2003.1197519
Publikováno v:
IDEAS
This paper aims for designing algorithms for the problem of mining frequent traversal path patterns from very large Web logs with best possible efficiency. We devise two algorithms for this problem with the help of fast construction of "shallow" gene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::882cfb3dd4145d5ab7bf9ff31a15f38d
https://doi.org/10.1109/ideas.2003.1214918
https://doi.org/10.1109/ideas.2003.1214918