3946 search results - page 303 / 790 » The computational complexity of choice sets |
185
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
174
click to vote
PRL
2010
15 years 5 months ago
2010
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
207
Voted
EGPGV
2004
Springer
16 years 5 days ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
192
click to vote
FGCS
2008
15 years 6 months ago
2008
The development of many complex simulation applications requires collaborative effort from researchers with different domain knowledge and expertise, possibly at different locatio...
176
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...