Sciweavers

2477 search results - page 392 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 4 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
ACMSE
2010
ACM
14 years 12 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 5 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
CGO
2003
IEEE
15 years 10 months ago
Optimizing Memory Accesses For Spatial Computation
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
Mihai Budiu, Seth Copen Goldstein
158
Voted
CODES
2003
IEEE
15 years 10 months ago
Design space exploration of a hardware-software co-designed GF(2m) galois field processor for forward error correction and crypt
This paper describes a hardware-software co-design approach for flexible programmable Galois Field Processing for applications which require operations over GF(2m ), such as RS an...
Wei Ming Lim, Mohammed Benaissa