Sciweavers

2681 search results - page 358 / 537
» Problem F
Sort
View
CIKM
2009
Springer
16 years 1 months ago
A machine learning approach for improved BM25 retrieval
Despite the widespread use of BM25, there have been few studies examining its effectiveness on a document description over single and multiple field combinations. We determine t...
Krysta Marie Svore, Christopher J. C. Burges
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
16 years 29 days ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
ATAL
2007
Springer
16 years 20 days ago
On the robustness of preference aggregation in noisy environments
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A....
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
16 years 1 days ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 12 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...