160 search results - page 15 / 32 » Approximability of Manipulating Elections |
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
ICDCSW
2005
IEEE
14 years 3 months ago
2005
IEEE
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
RT
2001
Springer
14 years 2 months ago
2001
Springer
Altering the viewing parameters of a 3D object results in computer graphics images of varying quality. One aspect of image quality is the composition of the image. While the esthet...
KDD
2012
ACM
12 years 3 days ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...