Sciweavers

1696 search results - page 338 / 340
» Permuted function matching
Sort
View
SIGIR
2011
ACM
13 years 18 days ago
Utilizing marginal net utility for recommendation in e-commerce
Traditional recommendation algorithms often select products with the highest predicted ratings to recommend. However, earlier research in economics and marketing indicates that a ...
Jian Wang, Yi Zhang
IACR
2011
127views more  IACR 2011»
12 years 9 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 5 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 5 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
SIGMOD
2012
ACM
190views Database» more  SIGMOD 2012»
12 years 7 days ago
Sample-driven schema mapping
End-users increasingly find the need to perform light-weight, customized schema mapping. State-of-the-art tools provide powerful functions to generate schema mappings, but they u...
Li Qian, Michael J. Cafarella, H. V. Jagadish