Sciweavers

2393 search results - page 304 / 479
» Bounds-Consistent Local Search
Sort
View
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 4 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
117
Voted
CLEF
2009
Springer
15 years 3 months ago
UNIBA-SENSE @ CLEF 2009: Robust WSD Task
This paper presents the participation of the semantic N-levels search engine SENSE at the CLEF 2009 Ad Hoc Robust-WSD Task. During the participation at the same task of CLEF 2008,...
Pierpaolo Basile, Annalina Caputo, Giovanni Semera...
113
Voted
AI
2005
Springer
15 years 2 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
119
Voted
ICCV
1999
IEEE
16 years 4 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
111
Voted
WWW
2007
ACM
16 years 3 months ago
Query topic detection for reformulation
In this paper, we show that most multiple term queries include more than one topic and users usually reformulate their queries by topics instead of terms. In order to provide empi...
Xuefeng He, Jun Yan, Jinwen Ma, Ning Liu, Zheng Ch...