Sciweavers

3096 search results - page 12 / 620
» The Generalized FITC Approximation
Sort
View
VLSID
2002
IEEE
124views VLSI» more  VLSID 2002»
14 years 9 months ago
Efficient Approximate Balanced Truncation of General Large-Scale RLC Systems via Krylov Methods
We present an efficient implementation of an approximate balanced truncation model reduction technique for general large-scale RLC systems, described by a statespace model where t...
Q. Su, Venkataramanan Balakrishnan, Cheng-Kok Koh
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 10 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
CIKM
2006
Springer
14 years 9 days ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
13 years 10 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 6 months ago
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw...