Sciweavers

52 search results - page 3 / 11
» Searching trajectories by locations: an efficiency study
Sort
View
WAIM
2010
Springer
13 years 5 months ago
Hotspot District Trajectory Prediction
Trajectory prediction (TP) of moving objects has grown rapidly to be a new exciting paradigm. However, existing prediction algorithms mainly employ kinematical models to approximat...
Hongjun Li, Changjie Tang, Shaojie Qiao, Yue Wang,...
JCSS
2002
95views more  JCSS 2002»
13 years 7 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
AAAI
2008
13 years 10 months ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
TKDE
2011
183views more  TKDE 2011»
13 years 2 months ago
Mining Discriminative Patterns for Classifying Trajectories on Road Networks
—Classification has been used for modeling many kinds of data sets, including sets of items, text documents, graphs, and networks. However, there is a lack of study on a new kind...
Jae-Gil Lee, Jiawei Han, Xiaolei Li, Hong Cheng
JMLR
2008
159views more  JMLR 2008»
13 years 7 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin