Sciweavers

236 search results - page 32 / 48
» Profiling Sets for Preference Querying
Sort
View
71
Voted
SAC
2010
ACM
15 years 4 months ago
Applying taxonomic knowledge to Bayesian belief network for personalized search
Keyword-based search returns its results without concern for the information needs of users at a particular time. In general, search queries are too short to represent what users ...
Jae-won Lee, Han-joon Kim, Sang-goo Lee
AAAI
2010
14 years 11 months ago
Stackelberg Voting Games: Computational Aspects and Paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can...
Lirong Xia, Vincent Conitzer
ECIR
2011
Springer
14 years 1 months ago
A Methodology for Evaluating Aggregated Search Results
Aggregated search is the task of incorporating results from different specialized search services, or verticals, into Web search results. While most prior work focuses on deciding...
Jaime Arguello, Fernando Diaz, Jamie Callan, Ben C...
DSMML
2004
Springer
15 years 3 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
15 years 10 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish