Related papers: Evaluating Alternative Glyph Design for Showing La…
We introduce the cause of the inefficiency of bivariate glyphs by defining the corresponding error. To recommend efficient and perceptually accurate bivariate-glyph design, we present an empirical study of five bivariate glyphs based on…
We present study results from two experiments to empirically validate that separable bivariate pairs for univariate representations of large-magnitude-range vectors are more efficient than integral pairs. The first experiment with 20…
Little is known about how people learn from a brief glimpse of three-dimensional (3D) bivariate vector field visualizations and about how well visual features can guide behavior. Here we report empirical study results on the use of color,…
A carefully constructed scatterplot can reveal plenty about an underlying data set. However, in most cases visually mining and understanding a large multivariate data set requires more finesse, and greater level of interactivity to really…
Glyph-based visualization is an effective tool for depicting multivariate information. Since sorting is one of the most common analytical tasks performed on individual attributes of a multi-dimensional data set, this motivates the…
Big Data involves both a large number of events but also many variables. This paper will concentrate on the challenge presented by the large number of variables in a Big Dataset. It will start with a brief review of exploratory data…
Uncertainty is inherent to most data, including vector field data, yet it is often omitted in visualizations and representations. Effective uncertainty visualization can enhance the understanding and interpretability of vector field data.…
We present the first empirical evaluation of techniques for encoding distributions of quantitative edge values within adjacency matrices. In many real-world networks, edges represent not a single value but a set of measurements. While…
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element only. We show…
Visualizations such as bar charts, scatter plots, and objects on geographical maps often convey critical information, including exact and relative numeric values, using shapes. The choice of shape and method of encoding information is often…
Quantum computing promises to improve the information processing power to levels unreachable by classical computation. Quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than…
This paper provides second-order optimality conditions for optimization problems with generalized equation constraints (GEPs), a framework that encompasses several important and challenging models in mathematical programming, including…
Generating font glyphs of consistent style from one or a few reference glyphs, i.e., font completion, is an important task in topographical design. As the problem is more well-defined than general image style transfer tasks, thus it has…
Graphical perception studies typically measure visualization encoding effectiveness using the error of an "average observer", leading to canonical rankings of encodings for numerical attributes: e.g., position > area > angle > volume. Yet…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
In each of the last five years, a few dozen empirical studies appeared in visualization journals and conferences. The existing empirical studies have already featured a large number of variables. There are many more variables yet to be…
Malleable Glyph is a new visualization problem and a public challenge. It originated from UX research (namely from research on card sorting UX), but its applications can be diverse (UI, gaming, information presentation, maps, and others).…
Geometric quantum machine learning uses the symmetries inherent in data to design tailored machine learning tasks with reduced search space dimension. The field has been well-studied recently in an effort to avoid barren plateau issues…
The goal of this paper is to discover a set of discriminative patches which can serve as a fully unsupervised mid-level visual representation. The desired patches need to satisfy two requirements: 1) to be representative, they need to occur…
Relativistic corrections to the evolution of structure can be used to test general relativity on cosmological scales. They are also a well-known systematic contamination in the search for a primordial non-Gaussian signal. We present a…