Výsledky vyhľadávania - "Practical approximation algorithms"

Practical approximation algorithms for ℓ1-regularized sparse rank-1 approximation to higher-order tensors Autor Mao, Xianpeng, Yang, Yuning

“…Two approximation algorithms are proposed for ℓ 1 -regularized sparse rank-1 approximation to higher-order tensors. The algorithms are based on multilinear…”
Získať plný text

Practical approximation algorithms for $${\ell}_1$$-regularized sparse rank-1 approximation to higher-order tensors Autor Mao, Xianpeng, Yang, Yuning

Získať plný text

Practical Budgeted Submodular Maximization Autor Feldman, Moran, Nutov, Zeev, Shoham, Elad

“…We consider the problem of maximizing a non-negative monotone submodular function subject to a knapsack constraint, which is also known as the Budgeted…”
Získať plný text

Practical Approximation Algorithms for \(\ell_1\)-Regularized Sparse Rank-\(1\) Approximation to Higher-Order Tensors Autor Mao, Xianpeng, Yang, Yuning

“…Two approximation algorithms are proposed for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors. The algorithms are based on…”
Získať plný text

Practical approximation algorithms for zero- and bounded-skew trees Autor ZELIKOVSKY, Alexander Z, MANDOIU, Ion I

Získať plný text

Practical Approximation Algorithms for Zero- and Bounded-Skew Trees Autor Zelikovsky, Alexander Z., Mandoiu, Ion I.

“…The skew of an edge-weighted rooted tree is the maximum difference between any two root-to-leaf path weights. Zero- or bounded-skew trees are needed for…”
Získať plný text

A practical approximation algorithm for the LTS estimator Autor Mount, David M., Netanyahu, Nathan S., Piatko, Christine D., Wu, Angela Y., Silverman, Ruth

“…The linear least trimmed squares (LTS) estimator is a statistical technique for fitting a linear model to a set of points. It was proposed by Rousseeuw as a…”
Získať plný text

A practical approximation algorithm for optimal k-anonymity Autor Kenig, Batya, Tassa, Tamir

“… The problem of k -anonymization with minimal loss of information is NP-hard. We present a practical approximation algorithm that enables solving the k -anonymization problem with an approximation guarantee of O (ln k…”
Získať plný text

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees Autor Iersel, Leo van, Kelk, Steven, Lekić, Nela, Scornavacca, Celine

“…Background Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to…”
Získať plný text

A practical approximation algorithm for the LMS line estimator Autor Mount, David M., Netanyahu, Nathan S., Romanik, Kathleen, Silverman, Ruth, Wu, Angela Y.

“…The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are…”
Získať plný text

Compressive Network Analysis Autor Xiaoye Jiang, Yuan Yao, Han Liu, Guibas, Leonidas

“…Modern data acquisition routinely produces massive amounts of network data. Though many methods and models have been proposed to analyze such data, the…”
Získať plný text

Clustering Large Probabilistic Graphs Autor Kollios, G., Potamias, M., Terzi, E.

“… We extend the edit-distance-based definition of graph clustering to probabilistic graphs. We establish a connection between our objective function and correlation clustering to propose practical approximation algorithms for our problem…”
Získať plný text

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees Autor Leo van Iersel, Kelk, Steven, Lekić, Nela, Scornavacca, Celine

“…Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain…”
Získať plný text

An improved lower bound on approximation algorithms for the Closest Substring problem Autor Wang, Jianxin, Chen, Jianer, Huang, Min

“… As a consequence, it is unlikely that the study of approximation schemes for the CSP problem in the literature would lead to practical approximation algorithms for the problem for small error bound ε…”
Získať plný text

Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems Autor Thilikos, Dimitrios M., Bodlaender, Hans L.

“… As a consequence, several maximum induced-subgraph problems when restricted to graph classes not containing some special l-apex graphs as minors, have practical approximation…”
Získať plný text

Ranking with submodular functions on the fly Autor Zhang, Guangyi, Tatti, Nikolaj, Gionis, Aristides

“… In particular, we consider two different streaming models and we propose practical approximation algorithms…”
Získať plný text

(\alpha\)-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms Autor Manne, Fredrik, Geevarghese, Philip, Saket Saurabh, Tale, Prafullkumar

“…Lokshtanov et al.~[STOC 2017] introduced \emph{lossy kernelization} as a mathematical framework for quantifying the effectiveness of preprocessing algorithms…”
Získať plný text

Compressive Network Analysis Autor Jiang, Xiaoye, Yao, Yuan, Liu, Han, Guibas, Leonidas

“…Modern data acquisition routinely produces massive amounts of network data. Though many methods and models have been proposed to analyze such data, the…”
Získať plný text

Towards practical minimum-entropy universal decoding Autor Coleman, T.P., Medard, M., Effros, M.

“… We introduce practical approximation algorithms for minimum-entropy decoding. Our approach, which relies on ideas from linear programming, exploits two key observations…”
Získať plný text

A local search approximation algorithm for k-means clustering Autor Kanungo, Tapas, Mount, David M., Netanyahu, Nathan S., Piatko, Christine D., Silverman, Ruth, Wu, Angela Y.

“… We consider the question of whether there exists a simple and practical approximation algorithm for k-means clustering…”
Získať plný text