Sciweavers

4843 search results - page 473 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
SIAMMAX
2010
117views more  SIAMMAX 2010»
15 years 27 days ago
On the Convergence of Rational Ritz Values
Ruhe's rational Krylov method is a popular tool for approximating eigenvalues of a given matrix, though its convergence behavior is far from being fully understood. Under fair...
Bernhard Beckermann, Stefan Güttel, Raf Vande...
TEC
2010
77views more  TEC 2010»
15 years 26 days ago
On Set-Based Multiobjective Optimization
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
Eckart Zitzler, Lothar Thiele, Johannes Bader
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 9 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
COCO
2011
Springer
261views Algorithms» more  COCO 2011»
14 years 6 months ago
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...
Ryan O'Donnell, Yi Wu, Yuan Zhou
FOCS
2004
IEEE
15 years 10 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev