@article {17980,
	title = {A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors},
	journal = {Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on},
	volume = {30},
	year = {2011},
	month = {2011/04//},
	pages = {494 - 507},
	abstract = {A new asynchronous interconnection network is introduced for globally-asynchronous locally-synchronous (GALS) chip multiprocessors. The network eliminates the need for global clock distribution, and can interface multiple synchronous timing domains operating at unrelated clock rates. In particular, two new highly-concurrent asynchronous components are introduced which provide simple routing and arbitration/merge functions. Post-layout simulations in identical commercial 90 nm technology indicate that comparable recent synchronous router nodes have 5.6-10.7 more energy per packet and 2.8-6.4 greater area than the new asynchronous nodes. Under random traffic, the network provides significantly lower latency and identical throughput over the entire operating range of the 800 MHz network and through mid-range traffic rates for the 1.36 GHz network, but with degradation at higher traffic rates. Preliminary evaluations are also presented for a mixed-timing (GALS) network in a shared-memory parallel architecture, running both random traffic and parallel benchmark kernels, as well as directions for further improvement.},
	keywords = {1.36, 800, 90, architecture;size, architectures;shared, asynchronous, benchmark, chip, chips;multiprocessor, distribution, distribution;frequency, GALS, GHz;frequency, interconnection, kernel;post-layout, layout;clock, locally-synchronous, memory, MHz;globally-asynchronous, multiple, multiprocessor;clock, multiprocessor;interface, network;mixed-timing, network;network, networks;microprocessor, networks;network, nm;circuit, Parallel, routing;network-on-chip;parallel, routing;parallel, simulation;random, synchronous, systems;, timing;low-overhead, traffic;shared-memory},
	isbn = {0278-0070},
	doi = {10.1109/TCAD.2011.2114970},
	author = {Horak,M.N. and Nowick,S.M. and Carlberg,M. and Vishkin, Uzi}
}
@conference {18241,
	title = {Modeling and analysis of content identification},
	booktitle = {Multimedia and Expo, 2009. ICME 2009. IEEE International Conference on},
	year = {2009},
	month = {2009/07/28/3},
	pages = {1528 - 1531},
	abstract = {Content fingerprinting provides a compact content-based representation of a multimedia document. An important application of fingerprinting is the identification of modified copies of the original media content. These modifications may be incidental changes that occur during the usage of multimedia, or intentional modifications made by an adversary to avoid detection. Currently, the effectiveness of content identification techniques is often assessed through benchmark databases. To complement these experimental performance evaluations, this paper develops a theoretical framework for analyzing content identification techniques. Beneficial aspects from decision theory and game theory are exploited to gain insights toward optimal system design and parameter selection.},
	keywords = {benchmark, databases;content, design;decision, document;optimal, identification, identification;game, representation;decision, system, systems;, techniques;content-based, theory;fingerprint, theory;fingerprinting, theory;multimedia},
	doi = {10.1109/ICME.2009.5202795},
	author = {Varna,A.L. and M. Wu}
}
@conference {16121,
	title = {Les le{\c c}ons tir{\'e}es des deux comp{\'e}titions de visualisation d{\textquoteright}information},
	booktitle = {Proceedings of the 16th conference on Association Francophone d{\textquoteright}Interaction Homme-Machine},
	series = {IHM 2004},
	year = {2004},
	month = {2004///},
	pages = {7 - 12},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Information visualization needs benchmarks to carry on. A benchmark is aimed at comparing information visualization techniques or systems. A benchmark is made of a dataset, a list of tasks mostly based on finding facts about the dataset, and a list of interesting or important findings about the datasets (the nuggets to find). For the second year, we are organizing the InfoVis Contest aimed at collecting results for benchmarks. We describe here the main lessons we learned.},
	keywords = {benchmark, contest, Evaluation, Information Visualization},
	isbn = {1-58113-926-8},
	doi = {10.1145/1148613.1148616},
	url = {http://doi.acm.org/10.1145/1148613.1148616},
	author = {Fekete,Jean-Daniel and Plaisant, Catherine}
}
