|
| 1 | +@article{cormode2012synopses, |
| 2 | + title={Synopses for massive data: Samples, histograms, wavelets, sketches}, |
| 3 | + author={Cormode, Graham and Garofalakis, Minos and Haas, Peter J and Jermaine, Chris}, |
| 4 | + journal={Foundations and Trends in Databases}, |
| 5 | + volume={4}, |
| 6 | + number={1--3}, |
| 7 | + pages={1--294}, |
| 8 | + year={2012}, |
| 9 | + publisher={Now Publishers Inc.} |
| 10 | +} |
| 11 | + |
| 12 | +@article{piatetsky1984accurate, |
| 13 | + title={Accurate estimation of the number of tuples satisfying a condition}, |
| 14 | + author={Piatetsky-Shapiro, Gregory and Connell, Charles}, |
| 15 | + journal={ACM Sigmod Record}, |
| 16 | + volume={14}, |
| 17 | + number={2}, |
| 18 | + pages={256--276}, |
| 19 | + year={1984}, |
| 20 | + publisher={ACM} |
| 21 | +} |
| 22 | + |
| 23 | +@article{cormode2005improved, |
| 24 | + title={An improved data stream summary: the count-min sketch and its applications}, |
| 25 | + author={Cormode, Graham and Muthukrishnan, Shan}, |
| 26 | + journal={Journal of Algorithms}, |
| 27 | + volume={55}, |
| 28 | + number={1}, |
| 29 | + pages={58--75}, |
| 30 | + year={2005}, |
| 31 | + publisher={Elsevier} |
| 32 | +} |
| 33 | + |
| 34 | +@article{selesnick2005dual, |
| 35 | + title={The dual-tree complex wavelet transform}, |
| 36 | + author={Selesnick, Ivan W and Baraniuk, Richard G and Kingsbury, Nick C}, |
| 37 | + journal={IEEE signal processing magazine}, |
| 38 | + volume={22}, |
| 39 | + number={6}, |
| 40 | + pages={123--151}, |
| 41 | + year={2005}, |
| 42 | + publisher={IEEE} |
| 43 | +} |
| 44 | + |
| 45 | +@article{garofalakis2004probabilistic, |
| 46 | + title={Probabilistic wavelet synopses}, |
| 47 | + author={Garofalakis, Minos and Gibbons, Phillip B}, |
| 48 | + journal={ACM Transactions on Database Systems (TODS)}, |
| 49 | + volume={29}, |
| 50 | + number={1}, |
| 51 | + pages={43--90}, |
| 52 | + year={2004}, |
| 53 | + publisher={ACM} |
| 54 | +} |
| 55 | + |
| 56 | +@article{bloom1970space, |
| 57 | + title={Space/time trade-offs in hash coding with allowable errors}, |
| 58 | + author={Bloom, Burton H}, |
| 59 | + journal={Communications of the ACM}, |
| 60 | + volume={13}, |
| 61 | + number={7}, |
| 62 | + pages={422--426}, |
| 63 | + year={1970}, |
| 64 | + publisher={ACM} |
| 65 | +} |
| 66 | + |
| 67 | +@article{Muthukrishnan:2005:DSA:1166409.1166410, |
| 68 | + author = {Muthukrishnan, S.}, |
| 69 | + title = {Data Streams: Algorithms and Applications}, |
| 70 | + journal = {Found. Trends Theor. Comput. Sci.}, |
| 71 | + issue_date = {August 2005}, |
| 72 | + volume = {1}, |
| 73 | + number = {2}, |
| 74 | + month = aug, |
| 75 | + year = {2005}, |
| 76 | + issn = {1551-305X}, |
| 77 | + pages = {117--236}, |
| 78 | + numpages = {120}, |
| 79 | + url = {http://dx.doi.org/10.1561/0400000002}, |
| 80 | + doi = {10.1561/0400000002}, |
| 81 | + acmid = {1166410}, |
| 82 | + publisher = {Now Publishers Inc.}, |
| 83 | + address = {Hanover, MA, USA}, |
| 84 | +} |
| 85 | + |
| 86 | +@article{259423, |
| 87 | + author={K. G. Shin and P. Ramanathan}, |
| 88 | + journal={Proceedings of the IEEE}, |
| 89 | + title={Real-time computing: a new discipline of computer science and engineering}, |
| 90 | + year={1994}, |
| 91 | + volume={82}, |
| 92 | + number={1}, |
| 93 | + pages={6-24}, |
| 94 | + keywords={computer architecture;fault tolerant computing;local area networks;multiprocessing systems;operating systems (computers);real-time systems;redundancy;reviews;scheduling;synchronisation;LAN;clock synchronisation;fault tolerance;real-time OS;real-time computing;redundancy management;scheduling;Application software;Automobiles;Computer displays;Computer science;Environmental economics;Humans;Processor scheduling;Real time systems;Resource management;Wheels}, |
| 95 | + doi={10.1109/5.259423}, |
| 96 | + ISSN={0018-9219}, |
| 97 | + month={Jan}, |
| 98 | +} |
| 99 | + |
| 100 | +@article{Karp:1992:OAV:645569.659725, |
| 101 | + author = {Karp, Richard M.}, |
| 102 | + title = {On-Line Algorithms Versus Off-Line Algorithms: How Much is It Worth to Know the Future?}, |
| 103 | + booktitle = {Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I}, |
| 104 | + year = {1992}, |
| 105 | + isbn = {0-444-89747-X}, |
| 106 | + pages = {416--429}, |
| 107 | + numpages = {14}, |
| 108 | + url = {http://dl.acm.org/citation.cfm?id=645569.659725}, |
| 109 | + acmid = {659725}, |
| 110 | + publisher = {North-Holland Publishing Co.}, |
| 111 | + address = {Amsterdam, The Netherlands, The Netherlands}, |
| 112 | +} |
| 113 | + |
| 114 | +@article{morris1978counting, |
| 115 | + title={Counting large numbers of events in small registers}, |
| 116 | + author={Morris, Robert}, |
| 117 | + journal={Communications of the ACM}, |
| 118 | + volume={21}, |
| 119 | + number={10}, |
| 120 | + pages={840--842}, |
| 121 | + year={1978}, |
| 122 | + publisher={ACM} |
| 123 | +} |
| 124 | + |
| 125 | +@article{flajolet1985probabilistic, |
| 126 | + title={Probabilistic counting algorithms for data base applications}, |
| 127 | + author={Flajolet, Philippe and Martin, G Nigel}, |
| 128 | + journal={Journal of computer and system sciences}, |
| 129 | + volume={31}, |
| 130 | + number={2}, |
| 131 | + pages={182--209}, |
| 132 | + year={1985}, |
| 133 | + publisher={Elsevier} |
| 134 | +} |
| 135 | + |
| 136 | +@article{woodruff2009frequency, |
| 137 | + title={Frequency moments}, |
| 138 | + author={Woodruff, David}, |
| 139 | + journal={Encyclopedia of Database Systems}, |
| 140 | + pages={1169--1170}, |
| 141 | + year={2009}, |
| 142 | + publisher={Springer} |
| 143 | +} |
| 144 | + |
| 145 | +@article{broder2004network, |
| 146 | + title={Network applications of bloom filters: A survey}, |
| 147 | + author={Broder, Andrei and Mitzenmacher, Michael}, |
| 148 | + journal={Internet mathematics}, |
| 149 | + volume={1}, |
| 150 | + number={4}, |
| 151 | + pages={485--509}, |
| 152 | + year={2004}, |
| 153 | + publisher={Taylor \& Francis} |
| 154 | +} |
| 155 | + |
| 156 | +@article{munro1980selection, |
| 157 | + title={Selection and sorting with limited storage}, |
| 158 | + author={Munro, J Ian and Paterson, Mike S}, |
| 159 | + journal={Theoretical computer science}, |
| 160 | + volume={12}, |
| 161 | + number={3}, |
| 162 | + pages={315--323}, |
| 163 | + year={1980}, |
| 164 | + publisher={Elsevier} |
| 165 | +} |
| 166 | + |
| 167 | +@article{feigenbaum2005graph, |
| 168 | + title={On graph problems in a semi-streaming model}, |
| 169 | + author={Feigenbaum, Joan and Kannan, Sampath and McGregor, Andrew and Suri, Siddharth and Zhang, Jian}, |
| 170 | + journal={Theoretical Computer Science}, |
| 171 | + volume={348}, |
| 172 | + number={2-3}, |
| 173 | + pages={207--216}, |
| 174 | + year={2005}, |
| 175 | + publisher={Elsevier} |
| 176 | +} |
| 177 | + |
| 178 | +@article{mcgregor2014graph, |
| 179 | + title={Graph stream algorithms: a survey}, |
| 180 | + author={McGregor, Andrew}, |
| 181 | + journal={ACM SIGMOD Record}, |
| 182 | + volume={43}, |
| 183 | + number={1}, |
| 184 | + pages={9--20}, |
| 185 | + year={2014}, |
| 186 | + publisher={ACM} |
| 187 | +} |
| 188 | + |
| 189 | +@article{batson2012twice, |
| 190 | + title={Twice-ramanujan sparsifiers}, |
| 191 | + author={Batson, Joshua and Spielman, Daniel A and Srivastava, Nikhil}, |
| 192 | + journal={SIAM Journal on Computing}, |
| 193 | + volume={41}, |
| 194 | + number={6}, |
| 195 | + pages={1704--1721}, |
| 196 | + year={2012}, |
| 197 | + publisher={SIAM} |
| 198 | +} |
| 199 | + |
| 200 | +@article{kruskal1956shortest, |
| 201 | + title={On the shortest spanning subtree of a graph and the traveling salesman problem}, |
| 202 | + author={Kruskal, Joseph B}, |
| 203 | + journal={Proceedings of the American Mathematical society}, |
| 204 | + volume={7}, |
| 205 | + number={1}, |
| 206 | + pages={48--50}, |
| 207 | + year={1956}, |
| 208 | + publisher={JSTOR} |
| 209 | +} |
| 210 | + |
| 211 | +@article{pettie2002optimal, |
| 212 | + title={An optimal minimum spanning tree algorithm}, |
| 213 | + author={Pettie, Seth and Ramachandran, Vijaya}, |
| 214 | + journal={Journal of the ACM (JACM)}, |
| 215 | + volume={49}, |
| 216 | + number={1}, |
| 217 | + pages={16--34}, |
| 218 | + year={2002}, |
| 219 | + publisher={ACM} |
| 220 | +} |
| 221 | + |
| 222 | +@article{bader2006fast, |
| 223 | + title={Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs}, |
| 224 | + author={Bader, David A and Cong, Guojing}, |
| 225 | + journal={Journal of Parallel and Distributed Computing}, |
| 226 | + volume={66}, |
| 227 | + number={11}, |
| 228 | + pages={1366--1378}, |
| 229 | + year={2006}, |
| 230 | + publisher={Elsevier} |
| 231 | +} |
| 232 | + |
| 233 | +@article{ching2015one, |
| 234 | + title={One trillion edges: Graph processing at facebook-scale}, |
| 235 | + author={Ching, Avery and Edunov, Sergey and Kabiljo, Maja and Logothetis, Dionysios and Muthukrishnan, Sambavi}, |
| 236 | + journal={Proceedings of the VLDB Endowment}, |
| 237 | + volume={8}, |
| 238 | + number={12}, |
| 239 | + pages={1804--1815}, |
| 240 | + year={2015}, |
| 241 | + publisher={VLDB Endowment} |
| 242 | +} |
| 243 | + |
| 244 | +@techreport{page1999pagerank, |
| 245 | + title={The PageRank citation ranking: Bringing order to the web.}, |
| 246 | + author={Page, Lawrence and Brin, Sergey and Motwani, Rajeev and Winograd, Terry}, |
| 247 | + year={1999}, |
| 248 | + institution={Stanford InfoLab} |
| 249 | +} |
| 250 | + |
| 251 | +@article{gleich2015pagerank, |
| 252 | + title={PageRank beyond the Web}, |
| 253 | + author={Gleich, David F}, |
| 254 | + journal={SIAM Review}, |
| 255 | + volume={57}, |
| 256 | + number={3}, |
| 257 | + pages={321--363}, |
| 258 | + year={2015}, |
| 259 | + publisher={SIAM} |
| 260 | +} |
| 261 | + |
| 262 | +@article{sanchez2012wireless, |
| 263 | + title={Wireless Channel Model with Markov Chains Using MATLAB}, |
| 264 | + author={S{\'a}nchez-Salas, Diana Alejandra and Cuevas-Ru{\'\i}z, Jos{\'e} Luis and Gonz{\'a}lez-Mendoza, Miguel}, |
| 265 | + journal={Edited by Vasilios N. Katsikis}, |
| 266 | + pages={235}, |
| 267 | + year={2012} |
| 268 | +} |
| 269 | + |
| 270 | +@article{boyle2005notes, |
| 271 | + title={Notes on the perron-frobenius theory of nonnegative matrices}, |
| 272 | + author={Boyle, MIKE}, |
| 273 | + journal={Dept. of Mathematics, University of Maryland, College Park, MD, USA, Web site: http://www. math. umd. edu/\~{} mboyle/courses/475sp05/spec. pdf}, |
| 274 | + year={2005} |
| 275 | +} |
| 276 | + |
| 277 | +@article{sarma2011estimating, |
| 278 | + title={Estimating pagerank on graph streams}, |
| 279 | + author={Sarma, Atish Das and Gollapudi, Sreenivas and Panigrahy, Rina}, |
| 280 | + journal={Journal of the ACM (JACM)}, |
| 281 | + volume={58}, |
| 282 | + number={3}, |
| 283 | + pages={13}, |
| 284 | + year={2011}, |
| 285 | + publisher={ACM} |
| 286 | +} |
| 287 | + |
| 288 | +@article{lempel2001salsa, |
| 289 | + title={SALSA: the stochastic approach for link-structure analysis}, |
| 290 | + author={Lempel, Ronny and Moran, Shlomo}, |
| 291 | + journal={ACM Transactions on Information Systems (TOIS)}, |
| 292 | + volume={19}, |
| 293 | + number={2}, |
| 294 | + pages={131--160}, |
| 295 | + year={2001}, |
| 296 | + publisher={ACM} |
| 297 | +} |
| 298 | + |
| 299 | +@article{kleinberg1999authoritative, |
| 300 | + title={Authoritative sources in a hyperlinked environment}, |
| 301 | + author={Kleinberg, Jon M}, |
| 302 | + journal={Journal of the ACM (JACM)}, |
| 303 | + volume={46}, |
| 304 | + number={5}, |
| 305 | + pages={604--632}, |
| 306 | + year={1999}, |
| 307 | + publisher={ACM} |
| 308 | +} |
| 309 | + |
| 310 | +@article{zaharia2010spark, |
| 311 | + title={Spark: Cluster computing with working sets.}, |
| 312 | + author={Zaharia, Matei and Chowdhury, Mosharaf and Franklin, Michael J and Shenker, Scott and Stoica, Ion}, |
| 313 | + journal={HotCloud}, |
| 314 | + volume={10}, |
| 315 | + number={10-10}, |
| 316 | + pages={95}, |
| 317 | + year={2010} |
| 318 | +} |
| 319 | + |
| 320 | +@article{abadi2016tensorflow, |
| 321 | + title={Tensorflow: Large-scale machine learning on heterogeneous distributed systems}, |
| 322 | + author={Abadi, Mart{\'\i}n and Agarwal, Ashish and Barham, Paul and Brevdo, Eugene and Chen, Zhifeng and Citro, Craig and Corrado, Greg S and Davis, Andy and Dean, Jeffrey and Devin, Matthieu and others}, |
| 323 | + journal={arXiv preprint arXiv:1603.04467}, |
| 324 | + year={2016} |
| 325 | +} |
| 326 | + |
| 327 | +@article{walt2011numpy, |
| 328 | + title={The NumPy array: a structure for efficient numerical computation}, |
| 329 | + author={Walt, St{\'e}fan van der and Colbert, S Chris and Varoquaux, Gael}, |
| 330 | + journal={Computing in Science \& Engineering}, |
| 331 | + volume={13}, |
| 332 | + number={2}, |
| 333 | + pages={22--30}, |
| 334 | + year={2011}, |
| 335 | + publisher={IEEE} |
| 336 | +} |
| 337 | + |
| 338 | +@article{jouppi2017datacenter, |
| 339 | + title={In-datacenter performance analysis of a tensor processing unit}, |
| 340 | + author={Jouppi, Norman P and Young, Cliff and Patil, Nishant and Patterson, David and Agrawal, Gaurav and Bajwa, Raminder and Bates, Sarah and Bhatia, Suresh and Boden, Nan and Borchers, Al and others}, |
| 341 | + journal={arXiv preprint arXiv:1704.04760}, |
| 342 | + year={2017} |
| 343 | +} |
0 commit comments