Sciweavers

200 search results - page 33 / 40
» What Graphs can be Efficiently Represented by BDDs
Sort
View
APLAS
2010
ACM
13 years 6 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
IPPS
2008
IEEE
14 years 1 months ago
Data throttling for data-intensive workflows
— Existing workflow systems attempt to achieve high performance by intelligently scheduling tasks on resources, sometimes even attempting to move the largest data files on the hi...
Sang-Min Park, Marty Humphrey
SIGMOD
2011
ACM
218views Database» more  SIGMOD 2011»
12 years 10 months ago
A data-oriented transaction execution engine and supporting tools
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
Ippokratis Pandis, Pinar Tözün, Miguel B...
ASAP
1997
IEEE
155views Hardware» more  ASAP 1997»
13 years 11 months ago
An Approach for Quantitative Analysis of Application-Specific Dataflow Architectures
In this paper we present an approach for quantitative analysis of application-specific dataflow architectures. The approach allows the designer to rate design alternatives in a qu...
Bart Kienhuis, Ed F. Deprettere, Kees A. Vissers, ...
CCS
2010
ACM
13 years 11 months ago
Towards publishing recommendation data with predictive anonymization
Recommender systems are used to predict user preferences for products or services. In order to seek better prediction techniques, data owners of recommender systems such as Netfli...
Chih-Cheng Chang, Brian Thompson, Hui (Wendy) Wang...