172 search results - page 25 / 35 » On the cost of searching signature trees |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
IPPS
2003
IEEE
14 years 26 days ago
2003
IEEE
Clustering, or unsupervised classification, has many uses in fields that depend on grouping results from large amount of data, an example being the N-body cosmological simulation ...
TIP
2008
13 years 7 months ago
2008
The present paper contributes two novel techniques in the context of image restoration by nonlocal filtering. Firstly, we introduce an efficient implementation of the nonlocal mean...
ALGORITHMICA
2005
13 years 7 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...