Sciweavers

1213 search results - page 25 / 243
» Approximation in quantale-enriched categories
Sort
View
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
14 years 27 days ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
CIKM
2004
Springer
14 years 5 days ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
ATAL
2007
Springer
13 years 10 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
CIKM
2010
Springer
13 years 5 months ago
Fast query expansion using approximations of relevance models
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
Marc-Allen Cartright, James Allan, Victor Lavrenko...
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
14 years 7 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin