Sciweavers

481 search results - page 38 / 97
» Distributed Consensus, revisited
Sort
View
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 9 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra
HPCC
2007
Springer
14 years 3 months ago
Parallel Database Sort and Join Operations Revisited on Grids
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
Werner Mach, Erich Schikuta
ATAL
2006
Springer
14 years 18 days ago
Symbolic negotiation revisited
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
Peep Küngas, Mihhail Matskin
CORR
2006
Springer
66views Education» more  CORR 2006»
13 years 9 months ago
MDL Denoising Revisited
We refine and extend an earlier MDL denoising criterion for wavelet-based denoising. We start by showing that the denoising problem can be reformulated as a clustering problem, whe...
Teemu Roos, Petri Myllymäki, Jorma Rissanen
PPOPP
2011
ACM
12 years 11 months ago
Programming the memory hierarchy revisited: supporting irregular parallelism in sequoia
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
Michael Bauer, John Clark, Eric Schkufza, Alex Aik...