Sciweavers

17329 search results - page 9 / 3466
» Improved non-approximability results
Sort
View
CLEF
2007
Springer
14 years 2 months ago
Using Pseudo-Relevance Feedback to Improve Image Retrieval Results
In this paper, we propose a pseudo-relevance feedback method to deal with the photographic retrieval and medical retrieval tasks of ImageCLEF 2007. The aim of our participation to...
Mouna Torjmen, Karen Pinel-Sauvagnat, Mohand Bough...
ACL
2008
13 years 10 months ago
Improving Search Results Quality by Customizing Summary Lengths
Web search engines today typically show results as a list of titles and short snippets that summarize how the retrieved documents are related to the query. However, recent researc...
Michael Kaisser, Marti A. Hearst, John B. Lowe
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 10 months ago
Improved results for directed multicut
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
Anupam Gupta
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 10 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
14 years 27 days ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater