This paper describes the Junctionality oj a 3D Graphics Raster Processor called TAYRA. TA YRA consists in the most part oj Graphics Raster Pipeline with five major external interfaces: PCI Master/Target, Depth, Texture, Colour and Video Interfaces. The Graphics Raster Pipeline perform'S' all the major OpenGL style (not necessarily compliant) raster functions: scan conversion; lines, spans, tria...

We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed geometrically, simply by having each vertex that receives M pass it along to any neighbor that is closer in the hyperbolic metric to the message’s eventual d...

A new discrete-time reverse-correlation scheme for the study of visual neurons is proposed. The visual stimulus is generated by drawing with uniform probability, at each refresh time, an image from a finite set S of orthonormal images. We show that if the neuron can be modeled as a spatiotemporal linear filter followed by a static nonlinearity, the cross-correlation between the input image sequ...

A new discrete-time reverse-correlation scheme for the study of visual neurons is proposed. The visual stimulus is generated by drawing with uniform probability, at each refresh time, an image from a finite set S of orthonormal images. We show that if the neuron can be modeled as a spatiotemporal linear filter followed by a static nonlinearity, the cross-correlation between the input image sequ...

Correlation mining is an approach of drawing statistical relationship between items from transaction data. Most of the existing techniques use Pearson’s correlation coefficient as a measure of correlation, which may not always perform well when data are noisy and binary in nature. Moreover, they require multi-pass over the database. This paper presents an effective and faster correlation mining...

We present a feature-guided salient rendering a 3D triangular mesh. For this, we compute directions on the vertices of the mesh and distribute noise on the faces of the mesh. After projecting the direction and noise into image space, we execute a convolution algorithm to render the mesh. We use three directions in this paper: a principal direction, the tangent direction of an isocurve of view-d...