12015 search results - page 443 / 2403 » Interactive Algorithms 2005 |
158
click to vote
ICTAI
2005
IEEE
15 years 10 months ago
2005
IEEE
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
127
click to vote
IV
2005
IEEE
15 years 10 months ago
2005
IEEE
We have developed a visual syntax for representing concepts that are contingent on temporal properties (timedependent semantics). A within-group (N=24) experiment was conducted to...
129
click to vote
PRDC
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper introduces the Sigma algorithm that solves fault-tolerant mutual exclusion problem in dynamic systems where the set of processes may be large and change dynamically, pr...
150
click to vote
CAIP
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
139
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...