Sciweavers

7150 search results - page 197 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
JSC
2006
132views more  JSC 2006»
15 years 6 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
IPL
2000
146views more  IPL 2000»
15 years 6 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
AOSD
2007
ACM
15 years 10 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 9 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
Numerical linear algebra in the streaming model
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
Kenneth L. Clarkson, David P. Woodruff