Sciweavers

1458 search results - page 60 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
15 years 6 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
AMR
2005
Springer
117views Multimedia» more  AMR 2005»
15 years 10 months ago
Learning User Queries in Multimodal Dissimilarity Spaces
Abstract. Different strategies to learn user semantic queries from dissimilarity representations of video audio-visual content are presented. When dealing with large corpora of vi...
Eric Bruno, Nicolas Moënne-Loccoz, Sté...
DSOM
1999
Springer
15 years 9 months ago
Derivation of Backup Service Management Applications from Service and System Models
The backup of large data sets is preferably performed automatically outside of regular working hours. In highly structured computer networks, however, faults and exceptions may rel...
Ingo Lück, Marcus Schönbach, Arnulf Mest...
ACII
2007
Springer
15 years 11 months ago
Entertainment Modeling in Physical Play Through Physiology Beyond Heart-Rate
An investigation into capturing the relation of physiology, beyond heart rate recording, to expressed preferences of entertainment in children’s physical gameplay is presented in...
Georgios N. Yannakakis, John Hallam
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
16 years 5 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou