Sciweavers

17329 search results - page 28 / 3466
» Improved non-approximability results
Sort
View
IJCAI
2003
13 years 10 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve...
SIGIR
2008
ACM
13 years 8 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland
DASFAA
2008
IEEE
106views Database» more  DASFAA 2008»
14 years 3 months ago
Flood Little, Cache More: Effective Result-Reuse in P2P IR Systems
State-of-the-art Peer-to-Peer Information Retrieval (P2P IR) systems suffer from their lack of response time guarantee especially with scale. To address this issue, a number of tec...
Christian Zimmer, Srikanta J. Bedathur, Gerhard We...
MM
2006
ACM
175views Multimedia» more  MM 2006»
14 years 2 months ago
Diversifying the image retrieval results
In the area of image retrieval, post-retrieval processing is often used to refine the retrieval results to better satisfy users’ requirements. Previous methods mainly focus on p...
Kai Song, YongHong Tian, Wen Gao, Tiejun Huang
WWW
2010
ACM
14 years 3 months ago
Diversifying web search results
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...
Davood Rafiei, Krishna Bharat, Anand Shukla