Sciweavers

495 search results - page 20 / 99
» Data exchange: computing cores in polynomial time
Sort
View
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 1 months ago
Polynomial Estimators for High Frequency Moments
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
Sumit Ganguly
IEEEARES
2006
IEEE
14 years 23 days ago
Fair Trading of Information: A Proposal for the Economics of Peer-to-Peer Systems
A P2P currency can be a powerful tool for promoting exchanges in a trusted way that make use of under-utilized resources both in computer networks and in real life. There are thre...
Kenji Saito, Eiichi Morino, Jun Murai
HPCA
2011
IEEE
12 years 10 months ago
MOPED: Orchestrating interprocess message data on CMPs
Future CMPs will combine many simple cores with deep cache hierarchies. With more cores, cache resources per core are fewer, and must be shared carefully to avoid poor utilization...
Junli Gu, Steven S. Lumetta, Rakesh Kumar, Yihe Su...
ATAL
2010
Springer
13 years 7 months ago
Honor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
Yoram Bachrach
EUROPAR
2007
Springer
14 years 27 days ago
SymGrid: A Framework for Symbolic Computation on the Grid
This paper introduces the design of SymGrid, a new Grid framework that will, for the first time, allow multiple invocations of symbolic computing applications to interact via the ...
Kevin Hammond, Abdallah Al Zain, Gene Cooperman, D...