160 search results - page 17 / 32 » Approximability of Manipulating Elections |
MIRAGE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
AAAI
2010
13 years 11 months ago
2010
In distributed work systems, individual users perform work for other users. A significant challenge in these systems is to provide proper incentives for users to contribute as muc...
IJCAI
2007
13 years 11 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
FMSD
2006
13 years 9 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
JAIR
2010
13 years 8 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...