Sciweavers

7215 search results - page 841 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
TALG
2010
86views more  TALG 2010»
15 years 5 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
SIGSOFT
2007
ACM
16 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
SIGSOFT
2005
ACM
16 years 8 months ago
Automatic generation of suggestions for program investigation
Before performing a modification task, a developer usually has to investigate the source code of a system to understand how to carry out the task. Discovering the code relevant to...
Martin P. Robillard
WWW
2008
ACM
16 years 8 months ago
Online learning from click data for sponsored search
Sponsored search is one of the enabling technologies for today's Web search engines. It corresponds to matching and showing ads related to the user query on the search engine...
Massimiliano Ciaramita, Vanessa Murdock, Vassilis ...
WWW
2007
ACM
16 years 8 months ago
Privacy-enhancing personalized web search
Personalized web search is a promising way to improve search quality by customizing search results for people with individual information goals. However, users are uncomfortable w...
Yabo Xu, Ke Wang, Benyu Zhang, Zheng Chen