Sciweavers

550 search results - page 10 / 110
» A general magnitude-preserving boosting algorithm for search...
Sort
View
EOR
2008
200views more  EOR 2008»
13 years 7 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
COLT
2005
Springer
14 years 28 days ago
Ranking and Scoring Using Empirical Risk Minimization
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
Stéphan Clémençon, Gáb...
DAM
2008
135views more  DAM 2008»
13 years 7 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
CIKM
2008
Springer
13 years 9 months ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church
WWW
2007
ACM
14 years 8 months ago
Automatic searching of tables in digital libraries
Tables are ubiquitous. Unfortunately, no search engine supports table search. In this paper, we propose a novel table specific searching engine, TableSeer, to facilitate the table...
Ying Liu, Kun Bai, Prasenjit Mitra, C. Lee Giles