1568 search results - page 197 / 314 » The problem of examination questions in algorithmics |
165
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
201
click to vote
EACL
2010
ACL Anthology
15 years 4 months ago
2010
ACL Anthology
Until recently, referring expression generation (reg) research focused on the task of selecting the semantic content of definite mentions of listener-familiar discourse entities. I...
175
click to vote
GECCO
2007
Springer
16 years 17 days ago
2007
Springer
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...
179
click to vote
STOC
2006
ACM
16 years 11 days ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
187
click to vote
SSDBM
2005
IEEE
15 years 12 months ago
2005
IEEE
With the growing demand on cluster analysis for categorical data, a handful of categorical clustering algorithms have been developed. Surprisingly, to our knowledge, none has sati...