Sciweavers

17329 search results - page 17 / 3466
» Improved non-approximability results
Sort
View
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 8 months ago
Improved Inapproximability For Submodular Maximization
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
Per Austrin
FQAS
2009
Springer
142views Database» more  FQAS 2009»
14 years 1 months ago
On the Selection of the Best Retrieval Result Per Query - An Alternative Approach to Data Fusion
Some recent works have shown that the “perfect” selection of the best IR system per query could lead to a significant improvement on the retrieval performance. Motivated by thi...
Antonio Juárez-González, Manuel Mont...
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
14 years 22 days ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
WSDM
2009
ACM
138views Data Mining» more  WSDM 2009»
14 years 3 months ago
Integration of news content into web results
Aggregated search refers to the integration of content from specialized corpora or verticals into web search results. Aggregation improves search when the user has vertical intent...
Fernando Diaz
VL
1995
IEEE
121views Visual Languages» more  VL 1995»
14 years 3 days ago
Buffering of Intermediate Results in Dataflow Diagrams
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. ...
Allison Woodruff, Michael Stonebraker