Sciweavers

2498 search results - page 7 / 500
» Data Structures with Unpredictable Timing
Sort
View
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
14 years 11 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
65
Voted
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
15 years 9 months ago
Subsequence Matching on Structured Time Series Data
Huanmei Wu, Betty Salzberg, Gregory C. Sharp, Stev...
ACTA
2010
104views more  ACTA 2010»
14 years 9 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
VLDB
1990
ACM
106views Database» more  VLDB 1990»
15 years 1 months ago
The Time Index: An Access Structure for Temporal Data
In this paper, we describe a new indexing technique, the time indez, for improving the performance of certain classes of temporal queries. The time index can be used to retrieve v...
Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim
SDM
2011
SIAM
256views Data Mining» more  SDM 2011»
14 years 12 days ago
Temporal Structure Learning for Clustering Massive Data Streams in Real-Time
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
Michael Hahsler, Margaret H. Dunham