维普期刊资源整合服务平台（V6.5）

48篇 您的检索式：作者名="Cormode G"

选中清除导出查看参考文献查看引证文献引用追踪共3页首页上一页第1页下一页末页 /3 跳转

	题名	作者	年代	出处	被引量
1	Methods for finding frequent items in data streams 显示文摘	Cormode G Hadjieleftheriou M	2010	The Int Journal on VLDB2010，19，1：	1
2	An improved data stream summary: The count rain sketch and its applications 显示文摘	Cormode G Muthukrishnan S	2005	Journal of Algorithms2005，55，1：	1
3	Methods for finding frequent items in data streams 显示文摘	Cormode G Hadjieleftheriou M	2010	The VLDB Journal2010，，1：	1
4	Approximation algorithms for clus-tering uncertain data显示文摘	Cormode G Mo Gregor A	2008	In ACM Principles of Database Systems(PODS)2008，，：	1
5	Finding the frequent items in streams of data显示文摘	Cormode G Hadjieleftheriou M	2009	Communications of ACM2009，52，10：	1
6	An Improved Data Stream Summary:The Count-Min Sketch and Its Applications显示文摘	Cormode G Muthukrishnan S	2005	Journal of Algorithms2005，55，1：	1
7	What's new: finding signifi2 cant differences in network data streams 显示文摘	CORMODE G MUTHUKR ISHAN S	2004	ACM INFOCOM2004，33，1：	1
8	Class-based graph anonymization for social network data 显示文摘	Bhagat S Cormode G Krishnamurthy B	2009	The VLDB Journal2009，2，1：	1
9	What's New: Finding Significant Differences in Network Data Streams显示文摘	Cormode G Muthukrishnan S	2005	IEEE/ACM Transactions on Networking2005，13，6：	1
10	An improved data stream summary: the count-min sketch and its applications显示文摘	CORMODE G MUTHUKRISHNAN S	2005	Journal of Algorithms2005，55，1：	1
11	An improved data stream summary:the count-min sketch and its applications显示文摘	Cormode G Muthukrishnan S	2005	Journal of Algorithms2005，55，1：	1
12	What' s new: finding significant differences in network data streams 显示文摘	Cormode G Muthukrishan S	2004	ACM NFOCOM2004，33，1：	1
13	Anonymizing Bi- partite Graph Data Using Safe Groupings显示文摘	Cormode G Srivastava D Yu Ting	2010	the VLDB Journal2010，19，1：	1
14	Anonymizing bipartite graph data using safe groupings 显示文摘	CORMODE G SRIVASTAVA D YU T	2010	VLDB Journal2010，19，1：	1
15	An improved data stream sum-mary:The count-min sketch and its applications显示文摘	Cormode G Muthukrishnan S	2005	Journalof Algorithms2005，55，1：	1
16	Approximation algorithms for clustering uncertain data显示文摘	CORMODE G McGregor A	2008	In ACM Principles of Database Systems (PODS)2008，，：	1
17	Combinatorial Algorithms For Compressed Senaing 显示文摘	Cormode G Muthukrishnan S	2006	IEEE Signal Processing Magazine2006，46，3：	1
18	Algorithms for distributed functional monitoring显示文摘	Cormode G Muthukrishnan S Yi K	2011	ACM Transactions on Algorithms2011，7，2：	1
19	Methods for finding freguent items in data streams显示文摘	Cormode G Hadjieleftheriou M	2010	The VLDB Journal2010，19，1：	1
20	An Improved Data Stream Summary: The Count min Sketch and Its Applications 显示文摘	Cormode G Muthukrishnan S	2005	Journal of Algorithms2005，55，1：	1

返回顶部每页显示：

共3页首页上一页第1页下一页末页 /3 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示