以前和大家分享过SIGMOD2009和2011的论文，朋友们都很感兴趣，现手里有ICDE2013的全部论文，再次和大家分享~ 一个包放不下，一共分成了4个包，包含142篇长文论文，还有64篇短文论文，朋友们可以挑选自己感兴趣的部分下载，我尽量把文章目录写得明白一些。 这是第二部分，共有50篇论文。 300. Finding Interesting Correlations with Conditional Heavy Hitters Katsiaryna Mirylenka Graham Co
% Time-Frequency Toolbox. % Version 1.0 January 1996 % Copyright (c) 1994-96 by CNRS (France) - RICE University (USA). % % Signal Generation Files % % sigmerge - Add two signals with given energy ratio in dB. % % Choice of the Instantaneous Amplitud
802.11n’s appeal can be summed up in one word—speed. In the stone ages of 1 Mbps and 2 Mbps wireless LANs, the most charitable thing that one could say about the technology was that it was faster than DSL. With the benefit of a decade of development
* PCA * Mixtures of probabilistic PCA * Gaussian mixture model with EM training algorithm * Linear and logistic regression with IRLS training algorithm * Multi-layer perceptron with linear, logistic and softmax outputs and appropriate error function
ANN is a library written in the C++ programming language to support both exact and approximate nearest neighbor searching in spaces of various dimensions. It was implemented by David M. Mount of the University of Maryland, and Sunil Arya of the Hong
Abstract—While image alignment has been studied in different areas of computer vision for decades, aligning images depicting different scenes remains a challenging problem. Analogous to optical flow where an image is aligned to its temporally adjace
C. Xiong, D. Johnson, and J. J. Corso, “Spectral active clustering via purification of the k-nearest neighbor graph,” in Proc. of European Conference on Data Mining, 2012. 的代码
ANN is a library written in the C++ programming language to support both exact and approximate nearest neighbor searching in spaces of various dimensions.ANN is also a testbed containing programs and procedures for generating data sets, collecting a
建立KD树的matlab程序。 % This function creates a KD Tree from the given points % and outputs it in the abstract object "kdtree" % The "kdtree" object can then be used for range finding % and nearest neighbor searching.
1 Introducing HBase 3 1.1 Data-management systems: a crash course 5 Hello, Big Data 6 ■ Data innovation 7 ■ The rise of HBase 8 1.2 HBase use cases and success stories 8 The canonical web-search problem: the reason for Bigtable’s invention 9 ■ Captu
