Sciweavers

567 search results - page 7 / 114
» Decomposing replicable functions
Sort
View
JC
2011
87views more  JC 2011»
13 years 2 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
TDSC
2010
218views more  TDSC 2010»
13 years 5 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...
UAI
1998
13 years 8 months ago
Utility Elicitation as a Classification Problem
The majority of real-world probabilistic systems are used by more than one user, thus a utility model must be elicited separately for each newuser. Utility elicitation is long and...
Urszula Chajewska, Lise Getoor, Joseph Norman, Yuv...
DAC
2004
ACM
14 years 8 months ago
An approach to placement-coupled logic replication
We present a set of techniques for placement-coupled, timingdriven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timingdrive...
Milos Hrkic, John Lillis, Giancarlo Beraudo
EDBT
2006
ACM
126views Database» more  EDBT 2006»
13 years 9 months ago
Replication, Load Balancing and Efficient Range Query Processing in DHTs
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash ...
Theoni Pitoura, Nikos Ntarmos, Peter Triantafillou