104 search results - page 7 / 21 » Adaptive Precision Setting for Cached Approximate Values |
CORR
2004
Springer
14 years 10 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
107
click to vote
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
105
click to vote
MFCS
2009
Springer
15 years 2 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
AAAI
1997
1997
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
14 years 11 months ago
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
ICCBR
2003
Springer
15 years 3 months ago
2003
Springer
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...