Sciweavers

492 search results - page 70 / 99
» Querying with Intrinsic Preferences
Sort
View
WWW
2011
ACM
13 years 4 months ago
Ranking in context-aware recommender systems
As context is acknowledged as an important factor that can affect users’ preferences, many researchers have worked on improving the quality of recommender systems by utilizing ...
Minsuk Kahng, Sangkeun Lee, Sang-goo Lee
EDBT
2000
ACM
14 years 1 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 10 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
ECIR
2009
Springer
14 years 7 months ago
Choosing the Best MT Programs for CLIR Purposes - Can MT Metrics Be Helpful?
Abstract. This paper describes usage of MT metrics in choosing the best candidates for MT-based query translation resources. Our main metrics is METEOR, but we also use NIST and BL...
Kimmo Kettunen
ICML
2006
IEEE
14 years 6 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford