3818 search results - page 259 / 764 » Word Problems on Compressed Words |
210
click to vote
ACL
2012
13 years 9 months ago
2012
There has been recent interest in the problem of decoding letter substitution ciphers using techniques inspired by natural language processing. We consider a different type of cla...
134
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
We consider the problem of combining ranking results from various sources. In the context of the Web, the main applications include building meta-search engines, combining ranking...
198
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
194
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
172
click to vote
ADC
2006
Springer
16 years 17 days ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...