Results 231 to 240 of about 557,141 (262)

Space efficiency in group recommendation

The VLDB Journal, 2010
Imagine a system that gives you satisfying recommendations when you want to rent a movie with friends or find a restaurant to celebrate a colleague's farewell: at the core of such a system is what we call group recommendation. While computing individual recommendations have received lots of attention (e.g., Netflix prize), group recommendation has been
Senjuti Basu Roy, Sihem Amer-Yahia, Ashish Chawla, Gautam Das 0001, Cong Yu 0001   +4 more
openaire   +1 more source

Geometric spaces and efficient codes

Journal of Geometry, 1995
The theory of geometric spaces is used to construct new efficient error control codes. The emphasis is on single error correcting-double error detecting codes. Both encoding and decoding algorithms are given and analysed. A comparison is given with a shortened Hamming code to show that the new codes provide faster and less complex circuits for the ...
openaire   +1 more source

Highly Space Efficient Blacklisting

2014
Many recent mobile devices have CPU units comparable to desktop computers while the storage capacity they offer is significantly reduced, often by a factor of one hundred. This restriction is crucial for most current blacklisting solutions which have good performance but suffer from large memory consumption.
Marián Kühnel, Ulrike Meyer
openaire   +1 more source

A time and space efficient net extractor

Proceedings of the 23rd ACM/IEEE conference on Design automation - DAC '86, 1986
An efficient algorithm is developed for net extraction. This algorithm is able to handle very large layouts efficiently even when memory is limited. This is done by using disk storage effectively. The algorithm has been programmed in Fortran and is superior to other existing net extractors.
Surendra Nahar, Sartaj Sahni
openaire   +1 more source

The design of a space efficient compiler

ACM SIGMINI Newsletter, 1978
Writing a compiler for a small machine with minimal software support can be quite difficult because the program is long and debugging aids are usually inadequate. In addition, the usual techniques for compiler writing tend to produce programs which are quite large when compared to, for example, a BASIC interpreter. This frustrates efforts for producing
openaire   +1 more source

Space-efficient scheduling of multithreaded computations

Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93, 1993
Summary: This paper considers the problem of scheduling dynamic parallel computations to achieve linear speedup without using significantly more space per processor than that required for a single-processor execution. Utilizing a new graph-theoretic model of multithreaded computation, execution efficiency is quantified by three important measures ...
Robert D. Blumofe, Charles E. Leiserson
openaire   +1 more source

Space Discretization for Efficient Human Navigation

Computer Graphics Forum, 1998
There is a large body of research on motion control of legs in human models. However, they require specification of global paths in which to move. A method for automatically computing a global motion path for a human in 3D environment of obstacles is presented. Object space is discretized into a 3D grid of uniform cells and an optimal path is generated
Bandi, S., Thalmann, D.
openaire   +2 more sources

Efficient matching of space curves

1995
The aim is to provide invariant signatures for matching space curves under Euclidean motions. Semi-differential rather than differential invariants can be used for the description and recognition of space curves. They have the advantage of being more robust, but on the other hand introduce the problem of finding good reference points. In order to avoid
Tomás Pajdla, Luc Van Gool
openaire   +1 more source

Space and Time Efficient Virtual Quadtress

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
The quadtree has recently become a major data structure in image processing. This correspondence investigates ways in which quadtrees may be efficiently stored as a forest of quadtrees and as a new structure we call a compact quadtree. These new structures are called virtual quadtrees because the basic operations we expect to perform in moving about ...
Leslie P. Jones, S. Sitharama Iyengar
openaire   +2 more sources

Space-Efficient Computation by Interaction

2006
We introduce a typed functional programming language for logarithmic space. Its type system is an annotated subsystem of Hofmann’s polytime LFPL. To guide the design of the programming language and to enable the proof of logspace-soundness, we introduce a realisability model over a variant of the Geometry of Interaction. This realisability model, which
openaire   +1 more source