Sciweavers

2880 search results - page 359 / 576
» Approximate Range Searching
Sort
View
WINE
2009
Springer
194views Economy» more  WINE 2009»
15 years 10 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
BTW
2009
Springer
145views Database» more  BTW 2009»
15 years 10 months ago
Towards web Supported Identification of Top Affiliations from Scholarly Papers
: Frequent successful publications by specific institutions are indicators for identifying outstanding centres of research. This institution data are present in scholarly papers as...
David Aumüller
GECCO
2009
Springer
15 years 10 months ago
An evolutionary approach to planning IEEE 802.16 networks
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf, Rob...
RECSYS
2009
ACM
15 years 10 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
105
Voted
ICASSP
2008
IEEE
15 years 9 months ago
Implementation of message-passing algorithms for the acquisition of spreading codes
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...
Massimo Rovini, Fabio Principe, Luca Fanucci, Marc...