4066 search results - page 332 / 814 » Almost Complete Sets |
174
click to vote
AAAI
2006
15 years 8 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
196
click to vote
NIPS
2003
15 years 8 months ago
2003
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
162
Voted
DAWAK
2010
Springer
15 years 7 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each...
155
Voted
AI
2006
Springer
15 years 6 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...