2925 search results - page 292 / 585 » Information Complexity of Online Problems |
162
click to vote
GROUP
2007
ACM
15 years 10 months ago
2007
ACM
Being aware of others' activities has played a vital role in the success of online collaboration. This resulted in the emergence of many groupware systems that provide users ...
226
click to vote
SIGIR
2012
ACM
13 years 9 months ago
2012
ACM
We propose a mathematical framework for query selection as a mechanism for reducing the cost of constructing information retrieval test collections. In particular, our mathematica...
153
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Given the large number and complexity of Chinese characters, pattern matching based on structural decomposition and analysis is believed to be necessary and essential to off-line ...
150
click to vote
SPIRE
2007
Springer
16 years 24 days ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
194
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...