3946 search results - page 240 / 790 » The computational complexity of choice sets |
163
click to vote
DIS
2008
Springer
15 years 8 months ago
2008
Springer
Taxonomies for a set of features occur in many real-world domains. An example is provided by paleontology, where the task is to determine the age of a fossil site on the basis of t...
179
click to vote
COLING
2010
15 years 1 months ago
2010
The problem addressed in this paper is to predict a user's numeric rating in a product review from the text of the review. Unigram and n-gram representations of text are comm...
202
click to vote
IUI
2012
ACM
14 years 2 months ago
2012
ACM
One Feature (1F) is a simple and intuitive pruning strategy that reduces considerably the amount of computations required by Nearest-Neighbor gesture classifiers while still pres...
185
click to vote
PODC
2003
ACM
15 years 12 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
189
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
When using a shared memory multiprocessor, the programmer faces the selection of the portable programming model which will deliver the best performance. Even if he restricts his c...