Sciweavers

115 search results - page 17 / 23
» The Complexity of List Ranking of Trees
Sort
View
SIGIR
2012
ACM
13 years 13 days ago
TFMAP: optimizing MAP for top-n context-aware recommendation
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...
Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, ...
LREC
2010
164views Education» more  LREC 2010»
14 years 11 months ago
Semantic Feature Engineering for Enhancing Disambiguation Performance in Deep Linguistic Processing
The task of parse disambiguation has gained in importance over the last decade as the complexity of grammars used in deep linguistic processing has been increasing. In this paper ...
Danielle Ben-Gera, Yi Zhang 0003, Valia Kordoni
DEBU
2010
139views more  DEBU 2010»
14 years 7 months ago
Refining Information Extraction Rules using Data Provenance
Developing high-quality information extraction (IE) rules, or extractors, is an iterative and primarily manual process, extremely time consuming, and error prone. In each iteratio...
Bin Liu 0002, Laura Chiticariu, Vivian Chu, H. V. ...
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
15 years 11 months ago
Keyword Searching and Browsing in Databases using BANKS
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...