10051 search results - page 430 / 2011 » A Dynamic Separator Algorithm |
180
click to vote
AUSAI
2006
Springer
15 years 11 months ago
2006
Springer
Establishing relationships within a dataset is one of the core objectives of data mining. In this paper a method of correlating behaviour profiles in a continuous dataset is presen...
189
click to vote
KDD
2000
ACM
15 years 11 months ago
2000
ACM
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
182
Voted
NIPS
2007
15 years 9 months ago
2007
The control of high-dimensional, continuous, non-linear dynamical systems is a key problem in reinforcement learning and control. Local, trajectory-based methods, using techniques...
212
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
218
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...