Sciweavers

2593 search results - page 125 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
173
Voted
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 5 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
15 years 3 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
16 years 5 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
142
Voted
PAKDD
2005
ACM
96views Data Mining» more  PAKDD 2005»
15 years 10 months ago
Kernels over Relational Algebra Structures
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
ICASSP
2011
IEEE
14 years 8 months ago
Parallel computation of adaptive lattice filters
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
Dong-hwan Lee, Wonyong Sung