Sciweavers

434 search results - page 62 / 87
» Information measures for infinite sequences
Sort
View
WIDM
2004
ACM
15 years 5 months ago
Probabilistic models for focused web crawling
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
Hongyu Liu, Evangelos E. Milios, Jeannette Janssen
IFIP
2004
Springer
15 years 5 months ago
Imperfectness of Data for STS-Based Physical Mapping
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is wel...
Hiro Ito, Kazuo Iwama, Takeyuki Tamura
CIKM
2006
Springer
15 years 3 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
15 years 1 months ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
CLEF
2010
Springer
15 years 28 days ago
A Multi Cue Discriminative Approach to Semantic Place Classification
This paper describes the participation of Idiap-MULTI to the Robot Vision Task at imageCLEF 2010. Our approach was based on a discriminative classification algorithm using multiple...
Marco Fornoni, Jesus Martínez-Gómez,...