Sciweavers

584 search results - page 31 / 117
» On the Number of Halving Planes
Sort
View
SOFSEM
2007
Springer
14 years 3 months ago
A Simple Algorithm for Stable Minimum Storage Merging
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
Pok-Son Kim, Arne Kutzner
ARITH
2005
IEEE
14 years 3 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
INFOCOM
1998
IEEE
14 years 2 months ago
Doubling Memory Bandwidth for Network Buffers
Memory bandwidth is frequently a limiting factor in the design of high-speed switches and routers. In this paper, we introduce a buffering scheme called ping-pong buffering, that ...
Youngmi Joo, Nick McKeown
ICS
1997
Tsinghua U.
14 years 1 months ago
Eliminating Cache Conflict Misses through XOR-Based Placement Functions
This paper makes the case for the use of XOR-based placement functions for cache memories. It shows that these XOR-mapping schemes can eliminate many conflict misses for direct-ma...
Antonio González, Mateo Valero, Nigel P. To...
DAMON
2009
Springer
13 years 11 months ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner