3946 search results - page 97 / 790 » The computational complexity of choice sets |
112
click to vote
EWCBR
2006
Springer
15 years 3 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
ISVC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Computer assisted procedures play a key role in the improvement of surgical operations. The current techniques in simulation potentially lead to more accuracy, more safet...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We introduce a chess board analogy for displaying (projecting) obj...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...