Sciweavers

662 search results - page 32 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
ICDE
2004
IEEE
259views Database» more  ICDE 2004»
14 years 9 months ago
Querying about the Past, the Present, and the Future in Spatio-Temporal
Moving objects (e.g., vehicles in road networks) continuously generate large amounts of spatio-temporal information in the form of data streams. Efficient management of such strea...
Jimeng Sun, Dimitris Papadias, Yufei Tao, Bin Liu
ATAL
2010
Springer
13 years 9 months ago
Closing the learning-planning loop with predictive state representations
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
Byron Boots, Sajid M. Siddiqi, Geoffrey J. Gordon
VLDB
2002
ACM
101views Database» more  VLDB 2002»
14 years 8 months ago
Efficient similarity search for market basket data
Several organizations have developed very large market basket databases for the maintenance of customer transactions. New applications, e.g., Web recommendation systems, present th...
Alexandros Nanopoulos, Yannis Manolopoulos
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
13 years 9 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...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 8 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...