Sciweavers

2056 search results - page 367 / 412
» time 2000
Sort
View
JACM
2000
131views more  JACM 2000»
14 years 11 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
JACM
2000
73views more  JACM 2000»
14 years 11 months ago
Parallel RAMs with owned global memory and deterministic context-free language recognition
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
Patrick W. Dymond, Walter L. Ruzzo
JCNS
2000
165views more  JCNS 2000»
14 years 11 months ago
A Population Density Approach That Facilitates Large-Scale Modeling of Neural Networks: Analysis and an Application to Orientati
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
Duane Q. Nykamp, Daniel Tranchina
JSA
2000
116views more  JSA 2000»
14 years 11 months ago
Distributed vector architectures
Integrating processors and main memory is a promising approach to increase system performance. Such integration provides very high memory bandwidth that can be exploited efficientl...
Stefanos Kaxiras
NJC
2000
169views more  NJC 2000»
14 years 11 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann