412 search results - page 71 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
105
Voted
KDD
2005
ACM
15 years 5 months ago
2005
ACM
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
116
click to vote
KDD
2009
ACM
16 years 6 days ago
2009
ACM
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
178
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
95
Voted
ITCC
2005
IEEE
15 years 5 months ago
2005
IEEE
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
74
Voted
COCO
1998
Springer
15 years 3 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...