168 search results - page 19 / 34 » An Upper Bound for B2[2] Sequences |
272
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
133
click to vote
ALT
2007
Springer
16 years 3 months ago
2007
Springer
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
142
click to vote
LADC
2005
Springer
15 years 11 months ago
2005
Springer
We present a framework for building fail-safe hard real-time applications in timed asynchronous distributed systems subject to communication partitions and performance, omission, ...
189
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
172
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...