@conference {14926,
	title = {A Fast Algorithm for Constructing Inverted Files on Heterogeneous Platforms},
	booktitle = {Parallel Distributed Processing Symposium (IPDPS), 2011 IEEE International},
	year = {2011},
	month = {2011/05//},
	pages = {1124 - 1134},
	abstract = {Given a collection of documents residing on a disk, we develop a new strategy for processing these documents and building the inverted files extremely fast. Our approach is tailored for a heterogeneous platform consisting of a multicore CPU and a highly multithreaded GPU. Our algorithm is based on a number of novel techniques including: (i) a high-throughput pipelined strategy that produces parallel parsed streams that are consumed at the same rate by parallel indexers, (ii) a hybrid trie and B-tree dictionary data structure in which the trie is represented by a table for fast look-up and each B-tree node contains string caches, (iii) allocation of parsed streams with frequent terms to CPU threads and the rest to GPU threads so as to match the throughput of parsed streams, and (iv) optimized CUDA indexer implementation that ensures coalesced memory accesses and effective use of shared memory. We have performed extensive tests of our algorithm on a single node (two Intel Xeon X5560 Quad-core) with two NVIDIA Tesla C1060 attached to it, and were able to achieve a throughput of more than 262 MB/s on the ClueWeb09 dataset. Similar results were obtained for widely different datasets. The throughput of our algorithm is superior to the best known algorithms reported in the literature even when compared to those run on large clusters.},
	keywords = {architecture;graphics, B-tree, C1060;central, construction;multicore, CPU;multithreaded, data, device, dictionary, equipment;coprocessors;data, files, GPU;computer, graphic, indexer;Intel, pipelined, platform;high-throughput, PROCESSING, Quad-core;NVIDIA, strategy;hybrid, structure;CUDA, structure;inverted, structures;multiprocessing, systems;, Tesla, trie, unified, unit;computer, unit;heterogeneous, X5560, Xeon},
	doi = {10.1109/IPDPS.2011.107},
	author = {Wei, Zheng and JaJa, Joseph F.}
}
@conference {13952,
	title = {Kernelized R{\'e}nyi distance for speaker recognition},
	booktitle = {Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on},
	year = {2010},
	month = {2010/03//},
	pages = {4506 - 4509},
	abstract = {Speaker recognition systems classify a test signal as a speaker or an imposter by evaluating a matching score between input and reference signals. We propose a new information theoretic approach for computation of the matching score using the Re $\#$x0301;nyi entropy. The proposed entropic distance, the Kernelized Re $\#$x0301;nyi distance (KRD), is formulated in a non-parametric way and the resulting measure is efficiently evaluated in a parallelized fashion on a graphical processor. The distance is then adapted as a scoring function and its performance compared with other popular scoring approaches in a speaker identification and speaker verification framework.},
	keywords = {$\#$x0301;nyi, approach;input, distance;reference, entropy;graphical, equipment;entropy;speaker, graphic, identification;speaker, processor;information, Re, recognition;, recognition;speaker, signals;kernelized, signals;speaker, theoretic, verification;computer},
	doi = {10.1109/ICASSP.2010.5495587},
	author = {Vasan Srinivasan,B. and Duraiswami, Ramani and Zotkin,Dmitry N}
}
@conference {17962,
	title = {Skip Strips: maintaining triangle strips for view-dependent rendering},
	booktitle = {Visualization {\textquoteright}99. Proceedings},
	year = {1999},
	month = {1999/10//},
	pages = {131 - 518},
	abstract = {View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, view-dependent simplification techniques have not been able to take full advantage of the underlying graphics hardware. Specifically, triangle strips are a widely used hardware-supported mechanism to compactly represent and efficiently render static triangle meshes. However, in a view-dependent framework, the triangle mesh connectivity changes at every frame, making it difficult to use triangle strips. We present a novel data structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications.},
	keywords = {(computer, Acceleration, acceleration;graphics, applications;path, applications;skip-list-like, changes;view-dependent, compression;rendering, connectivity;triangle, data, datasets;graphics, datasets;static, environments;data, equipment;data, graphic, Graphics, graphics);spatial, hardware;hardware-supported, hierarchy, manner;static, mechanism;immediate-mode, mesh, meshes;triangle, nodes;view-dependent, rendering;view-dependent, simplification;visualization;computer, Skip, Strips;complex, strips;vertex, structure;dynamic, structures;, techniques;retained-mode, triangle, visualisation;rendering},
	doi = {10.1109/VISUAL.1999.809877},
	author = {El-Sana,J. and Azanli,E. and Varshney, Amitabh}
}
