93 search results - page 6 / 19 » What Makes the Arc-Preserving Subsequence Problem Hard |
SIGECOM
2004
ACM
14 years 24 days ago
2004
ACM
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
PODC
2012
ACM
11 years 9 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
Searching is inherently an interactive process usually requiring numerous iterations of querying and assessing in order to find the desired amount of relevant information. Essent...
AIED
2005
Springer
14 years 28 days ago
2005
Springer
Measuring the efficacy of ITS can be hard because there are many confounding factors: short, well-isolated studies suffer from insufficient interaction with the system, while longe...