Sciweavers

227 search results - page 15 / 46
» Weighted Coloring: Further Complexity and Approximability Re...
Sort
View
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
13 years 2 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
WILF
2009
Springer
196views Fuzzy Logic» more  WILF 2009»
14 years 7 days ago
Interactive Image Retrieval in a Fuzzy Framework
In this paper, an interactive image retrieval scheme using MPEG-7 visual descriptors is proposed. The performance of image retrieval systems is still limited due to semantic gap, w...
Malay Kumar Kundu, Minakshi Banerjee, Priyank Bagr...
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 2 days ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
TSP
2010
13 years 2 months ago
A recursive method for the approximation of LTI systems using subband processing
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
Damián Marelli, Minyue Fu
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 5 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...