Sciweavers

613 search results - page 80 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
SIGIR
2008
ACM
13 years 8 months ago
A bayesian logistic regression model for active relevance feedback
Relevance feedback, which traditionally uses the terms in the relevant documents to enrich the user's initial query, is an effective method for improving retrieval performanc...
Zuobing Xu, Ram Akella
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
14 years 3 months ago
H-LLL: using householder inside LLL
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
Ivan Morel, Damien Stehlé, Gilles Villard
ATAL
2010
Springer
13 years 9 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer
ICS
2010
Tsinghua U.
14 years 6 months ago
Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
Brendan Lucier