Sciweavers

1710 search results - page 127 / 342
» Parallelism in Structured Newton Computations
Sort
View
DEBS
2007
ACM
14 years 11 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
CORR
2010
Springer
85views Education» more  CORR 2010»
14 years 10 months ago
Generic design of Chinese remaindering schemes
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime inte...
Jean-Guillaume Dumas, Thierry Gautier, Jean-Louis ...
CONCUR
2004
Springer
15 years 3 months ago
Probabilistic Event Structures and Domains
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
Daniele Varacca, Hagen Völzer, Glynn Winskel
PPAM
2005
Springer
15 years 3 months ago
Adapting Linear Algebra Codes to the Memory Hierarchy Using a Hypermatrix Scheme
Abstract. We present the way in which we adapt data and computations to the underlying memory hierarchy by means of a hierarchical data structure known as hypermatrix. The applicat...
José R. Herrero, Juan J. Navarro
CLUSTER
2003
IEEE
15 years 3 months ago
Optimized Implementation of Extendible Hashing to Support Large File System Directory
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
Rongfeng Tang, Dan Meng, Sining Wu