2100 search results - page 181 / 420 » Learning to rank on graphs |
217
click to vote
KI
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
149
click to vote
SIGIR
2006
ACM
16 years 14 days ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
175
click to vote
CIVR
2005
Springer
16 years 2 days ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
178
click to vote
ICSM
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
161
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...