806 search results - page 133 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
STOC
2010
ACM
13 years 12 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
LFCS
2009
Springer
14 years 2 months ago
2009
Springer
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...