Sciweavers

340 search results - page 46 / 68
» ets 2009
Sort
View
77
Voted
WINE
2009
Springer
117views Economy» more  WINE 2009»
15 years 4 months ago
Envy-Free Allocations for Budgeted Bidders
We study the problem of identifying prices to support a given allocation of items to bidders in an envy-free way. A bidder will envy another bidder if she would prefer to obtain th...
David Kempe, Ahuva Mu'alem, Mahyar Salek
CALCO
2009
Springer
162views Mathematics» more  CALCO 2009»
15 years 4 months ago
Semantics of Higher-Order Recursion Schemes
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
Jirí Adámek, Stefan Milius, Jiri Vel...
CIKM
2009
Springer
15 years 4 months ago
Relying on topic subsets for system ranking estimation
Ranking a number of retrieval systems according to their retrieval effectiveness without relying on costly relevance judgments was first explored by Soboroff et al [6]. Over th...
Claudia Hauff, Djoerd Hiemstra, Franciska de Jong,...
CIKM
2009
Springer
15 years 4 months ago
Collaborative filtering using random neighbours in peer-to-peer networks
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
Arno Bakker, Elth Ogston, Maarten van Steen
104
Voted
COCOON
2009
Springer
15 years 4 months ago
On the Readability of Monotone Boolean Formulae
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf