2376 search results - page 373 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
PAMI
2006
13 years 9 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
SDM
2004
SIAM
13 years 10 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
ALGORITHMICA
2010
13 years 9 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
With an explosive growth of blogs, information seeking in blogosphere becomes more and more challenging. One example task is to find the most relevant topical blogs against a give...
KDD
2010
ACM
14 years 25 days ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...