16257 search results - page 191 / 3252 » D-finiteness: algorithms and applications |
147
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
The complexity exhibited by pervasive systems is constantly increasing. Customer electronics devices provide day to day a larger amount of functionalities. A common approach for g...
161
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
152
click to vote
LISA
2008
15 years 8 months ago
2008
The increased use of virtual machines in the enterprise environment presents an interesting new set of challenges for the administrators of today's information systems. In ad...
183
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
171
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...