18306 search results - page 3399 / 3662 » Algorithmics in Exponential Time |
92
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
119
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
135
Voted
CIVR
2009
Springer
15 years 9 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
142
Voted
CIVR
2009
Springer
15 years 9 months ago
2009
Springer
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
105
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...