Sciweavers

2018 search results - page 393 / 404
» Magnitude-preserving ranking algorithms
Sort
View
CIKM
2008
Springer
13 years 10 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
CLEF
2008
Springer
13 years 10 months ago
Cheshire at GeoCLEF 2008: Text and Fusion Approaches for GIR
In this paper we will briefly describe the approaches taken by Berkeley for the main GeoCLEF 2008 tasks (Mono and Bilingual retrieval). The approach this year used probabilistic t...
Ray R. Larson
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 10 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...
ECIR
2007
Springer
13 years 10 months ago
Combining Evidence for Relevance Criteria: A Framework and Experiments in Web Retrieval
Abstract. We present a framework that assesses relevance with respect to several relevance criteria, by combining the query-dependent and query-independent evidence indicating thes...
Theodora Tsikrika, Mounia Lalmas
RSS
2007
135views Robotics» more  RSS 2007»
13 years 9 months ago
Learning omnidirectional path following using dimensionality reduction
Abstract— We consider the task of omnidirectional path following for a quadruped robot: moving a four-legged robot along any arbitrary path while turning in any arbitrary manner....
J. Zico Kolter, Andrew Y. Ng