860 search results - page 43 / 172 » Lower Bounds on the Size of Test Data Sets |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
DATAMINE
2006
13 years 7 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
CJ
2010
13 years 7 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...