12194 search results - page 2296 / 2439 » cans 2010 |
178
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
169
click to vote
AAAI
2010
15 years 8 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
161
click to vote
AAAI
2010
15 years 8 months ago
2010
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
142
click to vote
AAAI
2010
15 years 8 months ago
2010
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can...
171
click to vote
AAAI
2010
15 years 8 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...