71 search results - page 8 / 15 » Optimal Distance Bounds on Time-Series Data. |
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
ORL
2008
14 years 9 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
CPM
2000
Springer
15 years 1 months ago
2000
Springer
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
MA
2010
Springer
14 years 8 months ago
2010
Springer
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...