Sciweavers

2019 search results - page 337 / 404
» Programming with Shared Data Abstractions
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 10 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
EWSN
2007
Springer
14 years 9 months ago
Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks
Initial deployments of wireless sensor networks (WSNs) were based on a many-to-one communication paradigm, where a single sink collects data from a number of data sources. Recently...
Pietro Ciciriello, Luca Mottola, Gian Pietro Picco
PKDD
2004
Springer
131views Data Mining» more  PKDD 2004»
14 years 3 months ago
Asynchronous and Anticipatory Filter-Stream Based Parallel Algorithm for Frequent Itemset Mining
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
Adriano Veloso, Wagner Meira Jr., Renato Ferreira,...
CCGRID
2001
IEEE
14 years 1 months ago
OVM: Out-of-Order Execution Parallel Virtual Machine
High performance computing on parallel architectures currently uses different approaches depending on the hardory model of the architecture, the abstraction level of the programmi...
George Bosilca, Gilles Fedak, Franck Cappello
IOPADS
1997
94views more  IOPADS 1997»
13 years 11 months ago
Remote I/O Fast Access to Distant Storage
As high-speed networks make it easier to use distributed resources, it becomes increasingly common that applications and their data are not colocated. Users have traditionally add...
Ian T. Foster, David Kohr, Rakesh Krishnaiyer, Jac...