1959 search results - page 280 / 392 » Document Management as a Database Problem |
123
click to vote
ICDT
2010
ACM
15 years 1 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...
DKE
1998
14 years 9 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...
CIKM
2009
Springer
15 years 4 months 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....
WEBDB
2010
Springer
15 years 2 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�...
KDD
1997
ACM
15 years 2 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...