Sciweavers

375 search results - page 7 / 75
» Accelerated spectral approximation
Sort
View
IMC
2006
ACM
14 years 3 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
NA
2010
96views more  NA 2010»
13 years 7 months ago
Spectral element methods on unstructured meshes: which interpolation points?
In the field of spectral element approximations, the interpolation points can be chosen on the basis of different criteria, going from the minimization of the Lebesgue constant to ...
Richard Pasquetti, Francesca Rapetti
GD
2006
Springer
14 years 21 days ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
SIAMSC
2008
136views more  SIAMSC 2008»
13 years 9 months ago
On the Time Splitting Spectral Method for the Complex Ginzburg-Landau Equation in the Large Time and Space Scale Limit
We are interested in the numerical approximation of the complex Ginzburg
Pierre Degond, Shi Jin, Min Tang
IJCNN
2006
IEEE
14 years 3 months ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe