114 search results - page 10 / 23 » An Offline Algorithm for Dimension-Bound Analysis |
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper presents a real-time face detection algorithm. It improves state-of-the-art 2D object detection techniques by additionally evaluating a disparity map, which is estimate...
DAWAK
2010
Springer
13 years 8 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-re...