1959 search results - page 280 / 392 » Document Management as a Database Problem |
210
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
165
click to vote
DKE
1998
15 years 5 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
182
click to vote
CIKM
2009
Springer
16 years 23 days ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
188
click to vote
WEBDB
2010
Springer
15 years 11 months ago
2010
Springer
The transition of search engine users’ intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how di�...
112
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
We presenthere an approachand algorithm for mining generalizedterm associations.The problem is to find co-occurrencefrequenciesof terms, given a collection of documents eachwith r...