Sciweavers

260 search results - page 3 / 52
» Trading Probability for Fairness
Sort
View
ESA
2009
Springer
94views Algorithms» more  ESA 2009»
14 years 2 months ago
Shape Fitting on Point Sets with Probability Distributions
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
Maarten Löffler, Jeff M. Phillips
ASWC
2009
Springer
14 years 10 days ago
IP-Explorer: A Semantic Web Based Intellectual Property Knowledge Base and Trading Platform
In this paper, we demonstrate IP-Explorer, a semantic web based IP knowledge base and trading platform with the following characteristics: First, it is based on the semantic web te...
Lei Zhang, Hugh Glaser, Hai-Tao Zheng, Ian Millard
JVCIR
2006
79views more  JVCIR 2006»
13 years 7 months ago
Trading off quality and complexity for a HVQ-based video codec on portable devices
Bandwidth and processing requirements of multimedia applications typically exceed capabilities of portable terminals with current technology. Applications should hence be able to ...
Marco Cagnazzo, Francesco Delfino, Luca Vollero, A...
AAIM
2008
Springer
138views Algorithms» more  AAIM 2008»
13 years 9 months ago
Confidently Cutting a Cake into Approximately Fair Pieces
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki
PODC
2010
ACM
13 years 11 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer