3897 search results - page 174 / 780 » complexity 2010 |
101
click to vote
EJC
2010
15 years 2 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
131
Voted
PAMI
2010
15 years 28 days ago
2010
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
142
Voted
SIAMDM
2010
15 years 28 days ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
117
click to vote
INLG
2010
Springer
15 years 14 days ago
2010
Springer
In this paper, we propose a general way of constructing an NLG system that permits the systematic exploration of the effects of particular system choices on output quality. We cal...
111
click to vote
CHI
2010
ACM
15 years 9 months ago
2010
ACM
Children want to find information about their world, but there are barriers to finding what they seek. Young people have varying abilities to formulate complex queries and compreh...