874 search results - page 170 / 175 » Faster Algorithms for Semi-Matching Problems |
143
Voted
PROMAS
2004
Springer
15 years 7 months ago
2004
Springer
Distributed partially observable Markov decision problems (POMDPs) have emerged as a popular decision-theoretic approach for planning for multiagent teams, where it is imperative f...
116
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
115
Voted
ICCAD
2006
IEEE
15 years 11 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
133
click to vote
PEPM
2009
ACM
15 years 11 months ago
2009
ACM
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
132
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...