3946 search results - page 220 / 790 » The computational complexity of choice sets |
191
click to vote
AFRIGRAPH
2007
ACM
15 years 10 months ago
2007
ACM
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
177
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
176
click to vote
3DPVT
2006
IEEE
16 years 22 days ago
2006
IEEE
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
190
click to vote
DCC
1998
IEEE
15 years 11 months ago
1998
IEEE
Multiple description coding (MDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction...
157
Voted
MSWIM
2006
ACM
16 years 19 days ago
2006
ACM
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...