19320 search results - page 249 / 3864 » On the complexity of computing determinants |
219
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
156
click to vote
JSAC
1998
15 years 6 months ago
1998
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...
169
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. A key step in Natural Language Processing is creating representations of sentences and discourses. Sentences describe states and events. Thus a crucial component of seman...
166
click to vote
CATS
2007
15 years 8 months ago
2007
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...
131
click to vote
COMMA
2008
15 years 8 months ago
2008
Human beings share a common competence for generating relevant arguments. We therefore hypothesize the existence of a cognitive procedure that enables them to determine the content...