Sciweavers

968 search results - page 52 / 194
» A faster implementation of APlace
Sort
View
ISSAC
2005
Springer
97views Mathematics» more  ISSAC 2005»
15 years 9 months ago
Probabilistic algorithms for computing resultants
Let A and B be two polynomials in   [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
Michael B. Monagan
SPAA
2000
ACM
15 years 8 months ago
Algorithmic foundations for a parallel vector access memory system
This paper presents mathematical foundations for the design of a memory controller subcomponent that helps to bridge the processor/memory performance gap for applications with str...
Binu K. Mathew, Sally A. McKee, John B. Carter, Al...
ISCA
1997
IEEE
96views Hardware» more  ISCA 1997»
15 years 8 months ago
DataScalar Architectures
DataScalar architectures improve memory system performance by running computation redundantly across multiple processors, which are each tightly coupled with an associated memory....
Doug Burger, Stefanos Kaxiras, James R. Goodman
CC
2006
Springer
101views System Software» more  CC 2006»
15 years 7 months ago
SARA: Combining Stack Allocation and Register Allocation
Commonly-used memory units enable a processor to load and store multiple registers in one instruction. We showed in 2003 how to extend gcc with a stack-location-allocation (SLA) ph...
V. Krishna Nandivada, Jens Palsberg
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
15 years 5 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...