3818 search results - page 61 / 764 » Word Problems on Compressed Words |
164
click to vote
LREC
2010
15 years 7 months ago
2010
Conventional methods for disambiguation problems have been using statistical methods with co-occurrence of words in their contexts. It seems that human-beings assign appropriate w...
125
click to vote
ICDM
2006
IEEE
16 years 6 days ago
2006
IEEE
Keyword3 generation for search engine advertising is an important problem for sponsored search or paidplacement advertising. A recent strategy in this area is bidding on nonobviou...
171
click to vote
SIAMDM
1998
15 years 5 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
178
click to vote
DCC
2001
IEEE
16 years 5 months ago
2001
IEEE
Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression (D...
181
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...