217 search results - page 33 / 44 » An improved dynamic programming algorithm for coalition stru... |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
UAI
1997
13 years 9 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
ISMB
1996
13 years 9 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
CF
2005
ACM
13 years 9 months ago
2005
ACM
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...