Results 1  10
of
839,167
Arbitrary Size Benes Networks
 Parallel Processing Letters
, 1997
"... The Benes network is a rearrangeable nonblocking network which can realize any arbitrary permutation. Overall, the rdimensional Benes network connects 2 r inputs to 2 r outputs through 2r \Gamma 1 levels of 2 \Theta 2 switches. Each level of switches consists of 2 r\Gamma1 switches, and hence ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
, and hence the size of the network has to be a power of two. In this paper, we extend Benes networks to arbitrary sizes. We also show that the looping routing algorithm used in Benes networks can be slightly modified and applied to arbitrary size Benes networks. 1 Introduction A multistage network consists
Multiresolution Analysis of Arbitrary Meshes
, 1995
"... In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multire ..."
Abstract

Cited by 605 (16 self)
 Add to MetaCart
in practice typically do not meet this requirement. In this paper we present a method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form. The method is based on the approximation of an arbitrary initial mesh M by a
Particles of Arbitrary Size and Hierarchical Order
, 2000
"... The exact solution of the asymmetric exclusion problem with N distinct classes of particles (c = 1,2,...,N), with hierarchical order is presented. In this model the particles (size 1) are located at lattice points, and diffuse with equal asymmetric rates, but particles in a class c do not distinguis ..."
Abstract
 Add to MetaCart
The exact solution of the asymmetric exclusion problem with N distinct classes of particles (c = 1,2,...,N), with hierarchical order is presented. In this model the particles (size 1) are located at lattice points, and diffuse with equal asymmetric rates, but particles in a class c do
Truthful Auctions for Arbitrary Sized Ads
"... Abstract. We consider designing truthful auctions allowing bidders to place advertisements of any desired size on sponsored search results. This may be a remedy for large companies wanting more visibility and consequently higher click through rates. It might also be a way to prevent a company’s com ..."
Abstract
 Add to MetaCart
Abstract. We consider designing truthful auctions allowing bidders to place advertisements of any desired size on sponsored search results. This may be a remedy for large companies wanting more visibility and consequently higher click through rates. It might also be a way to prevent a company’s
Improved Arbitrary Size Benes Network Gaurav Kumar
"... Multistage interconnection networks (MINs) are used to connect N inputs to N outputs. They are mainly used to connect processor to processor and for processor to memory in distributed and shared memory environment. The MINs are broadly divided into three categories Blocking Non Blocking and Rearrang ..."
Abstract
 Add to MetaCart
and Rearrangeable networks. A new improved Arbitrary size Benes network has been proposed in this to improve the permutation capabilities and to reduce the cost of
Particles of Arbitrary Size: Matrix Product Ansatz
, 2005
"... The exact solution of the asymmetric exclusion problem and several of its generalizations is obtained by a matrix product ansatz. Due to the similarity of the master equation and the Schrödinger equation at imaginary times the solution of these problems reduces to the diagonalization of a one dimens ..."
Abstract
 Add to MetaCart
dimensional quantum Hamiltonian. We present initially the solution of the problem when an arbitrary mixture of molecules, each of then having an arbitrary size (s = 0,1,2,...) in units of lattice spacing, diffuses asymmetrically on the lattice. The solution of the more general problem where we have
Fast Construction Of Covariance Matrices For Arbitrary Size Image
 in Proc. Intl. Conf. on Image Processing
, 2006
"... We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator of how much the deviation of two or more variables match. In our case, these variables correspond to pointwise features, ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator of how much the deviation of two or more variables match. In our case, these variables correspond to pointwise features, e.g. coordinates, color values, gradients, edge magnitude and orientation, local histograms, filter responses, etc. We significantly improve the speed of the covariance computation by taking advantage of the spatial arrangement of image points using integral images, which are intermediate representations used for calculation of region sums. Each point of the integral image corresponds to the summation of all point values inside the feature image rectangle bounded by the upper left corner and the point of interest. Using this representation, any rectangular region sum can be computed in constant time. We follow a similar idea for fast calculation of region covariance. We construct integral images for all separate features as well as integral images of the multiplication of any two feature combinations. Using these set of integral images and region corner point coordinates, we directly extract the covariance matrix coefficients. We show that the proposed method reduces the computational load to quadratic time.
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
 Proc. 27th Australasian Conf. on Computer Science, 2004
, 2004
"... Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarchies, or database schemas can be modelled by graphs and represented visually using graph drawing algorithms. Most existing ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
existing graph drawing algorithms do not consider the size of nodes when creating a drawing. In most real world applications, however, nodes contain information which has to be displayed and nodes thus need a specific area to display this information. The required area can vary significantly between di
Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines
"... Energy consumption has become an important concern in the design of modern processors, not only for batteryoperated mobile devices with single processors but also for server farms or laptops with multicore processors. A popular technology to reduce energy usage is dynamic speed scaling (see e.g., ..."
Abstract
 Add to MetaCart
Energy consumption has become an important concern in the design of modern processors, not only for batteryoperated mobile devices with single processors but also for server farms or laptops with multicore processors. A popular technology to reduce energy usage is dynamic speed scaling (see e.g., [1, 2, 3, 6]) where the processor can vary its speed dynamically. The power consumption
Poster: (Symmetric) PIR over Arbitrary Sized Records
"... Private information retrieval (PIR) is a cryptographic technique that helps users retrieve information from a database in a way that is highly respectful of privacy: the user submits a query encoding a set of keywords [1], the indices of certain records [2], or some simple SQL statements [3], and th ..."
Abstract
 Add to MetaCart
Private information retrieval (PIR) is a cryptographic technique that helps users retrieve information from a database in a way that is highly respectful of privacy: the user submits a query encoding a set of keywords [1], the indices of certain records [2], or some simple SQL statements [3], and the database server processes and responds to the query without learning any nontrivial information about what information the user is after. The trivial way to solve the PIR problem is to have the database server respond to every query with the entire database, and then let the user carry out her own local keyword searches, index lookups, or SQL statement evaluations. This solution is simple and informationtheoretically secure, but it is not very interesting and it is highly impractical for large databases since the communication
Results 1  10
of
839,167