4114 search results - page 236 / 823 » Efficient Algorithms for the 2-Center Problems |
181
click to vote
ICDM
2005
IEEE
16 years 5 days ago
2005
IEEE
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
209
click to vote
CIAC
1994
Springer
15 years 10 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
186
click to vote
DCOSS
2007
Springer
15 years 10 months ago
2007
Springer
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
176
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
189
click to vote
DEXA
2008
Springer
15 years 8 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...