Sciweavers

492 search results - page 62 / 99
» The number of possibilities for random dating
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
NETWORK
2008
119views more  NETWORK 2008»
13 years 8 months ago
Improving the Performance of Route Control Middleboxes in a Competitive Environment
Multihomed subscribers are increasingly adopting intelligent route control solutions to optimize the cost and end-to-end performance of the traffic routed among the different link...
Marcelo Yannuzzi, Xavier Masip-Bruin, Eva Mar&iacu...
CP
2003
Springer
14 years 1 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
BMCBI
2006
165views more  BMCBI 2006»
13 years 8 months ago
Improved variance estimation of classification performance via reduction of bias caused by small sample size
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
Ulrika Wickenberg-Bolin, Hanna Göransson, M&a...
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 7 months ago
Secure Multiparty Computation with Partial Fairness
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
Amos Beimel, Eran Omri, Ilan Orlov