Visualizing very large matrices involves many formidable problems. Various popular solutions to these problems involve sampling, clustering, projection, or feature selection reduce the size and complexity of original task. An important aspect methods is how preserve relative distances between points in higher-dimensional space after reducing rows columns fit a lower dimensional space. This beca...

recommender systems utilize information retrieval and machine learning techniques for filtering information and can predict whether a user would like an unseen item. user similarity measurement plays an important role in collaborative filtering based recommender systems. in order to improve accuracy of traditional user based collaborative filtering techniques under new user cold-start problem a...

We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not only we reduce the sketch size, but also restore the differences between the streams. Our contribution: For two streams with hamming distance bounded by k we show a sketch of size O(k logn) with O(logn) processing time ...

In this paper, we consider the problem of estimating the distance between any two large data streams in smallspace constraint. This problem is of utmost importance in data intensive monitoring applications where input streams are generated rapidly. These streams need to be processed on the fly and accurately to quickly determine any deviance from nominal behavior. We present a new metric, the S...

In this paper, we consider the problem of estimating the distance between any two large data streams in smallspace constraint. This problem is of utmost importance in data intensive monitoring applications where input streams are generated rapidly. These streams need to be processed on the fly and accurately to quickly determine any deviance from nominal behavior. We present a new metric, the S...

The count-min sketch is a useful data structure for recording and estimating the frequency of string occurrences, such as passwords, in sub-linear space with high accuracy. However, it cannot be used to draw conclusions on groups of strings that are similar, for example close in Hamming distance. This paper introduces a variant of the count-min sketch which allows for estimating counts within a...

Zero-shot sketch-based image retrieval (ZSSBIR) aims at retrieving natural images given free hand-drawn sketches that may not appear during training. Previous approaches used semantic aligned sketch-image pairs or utilized memory expensive fusion layer for projecting the visual information to a low-dimensional subspace, which ignores significant heterogeneous cross-domain discrepancy between hi...

design process consists of multiple coherent stages in which a lot of factors involve and their impact on each other is inseparable. design is a process of transfer, translates, and interact the concepts and internal ideas of designer through sketches. visual reasoning is the main factor in connecting designer's knowledge and experiences through sketch and continues till achieving a satisf...

The emergence of real life graphs with billions of nodes poses significant challenges for managing and querying these graphs. One of the fundamental queries submitted to graphs is the shortest distance query. Online BFS (breadth-first search) and offline pre-computing pairwise shortest distances are prohibitive in time or space complexity for billion-node graphs. In this paper, we study the fea...

We present a sketch-based interface for animating virtual face models. Our approach first converts an input sketch into a set of strokes (curves). Each stroke is automatically associated with a facial element, such as eyes and mouth, and then compared against a set of template curves. The degree of similarity between input strokes and a template element defines the weights for a blendshape-base...