Sciweavers

1161 search results - page 39 / 233
» Efficient search engine measurements
Sort
View
CP
2006
Springer
15 years 3 months ago
Inferring Variable Conflicts for Local Search
Abstract. For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. The...
Magnus Ågren, Pierre Flener, Justin Pearson
STEP
2005
IEEE
15 years 5 months ago
Software Process Improvement, Quality Assurance and Measurement
The article focuses on a problem software companies often face: the need to choose a software quality model that, besides being auditable, ensures the connection of quality goals ...
Jos J. M. Trienekens, Rob J. Kusters, Katalin Ball...
WWW
2009
ACM
16 years 14 days ago
Sitemaps: above and beyond the crawl of duty
Comprehensive coverage of the public web is crucial to web search engines. Search engines use crawlers to retrieve pages and then discover new ones by extracting the pages' o...
Uri Schonfeld, Narayanan Shivakumar
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
14 years 9 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
WWW
2010
ACM
15 years 6 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson