首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > 这个项目提供了在处理连续top-k查询文本流问题的解的个数

这个项目提供了在处理连续top-k查询文本流问题的解的个数

资 源 简 介

The code provided was used for the testing and experimental evaluation of the results given in the article: Nelly Vouzoukidou, Bernd Amann, and Vassilis Christophides. "Processing continuous text queries featuring non-homogeneous scoring functions" Proceedings of the 21st ACM international conference on Information and knowledge management. ACM, 2012. http://dl.acm.org/citation.cfm?id=2398404 A full description of this project can be found in this paper. Project author: Nelly Vouzoukidou

文 件 列 表

datasets
itemsTfIdf15000.txt
queriesTfIdf.txt
nbproject
private
project.properties
project.xml
genfiles.properties
build-impl.xml
props
sortedTfIdf.csv
src
examples
gr
test
manifest.mf
build.xml

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP
0.161322s