Sciweavers

TCSV
2002
88views more  TCSV 2002»
13 years 11 months ago
Variable complexity DCT approximations driven by an HVQ-based analyzer
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
Ricardo L. de Queiroz
MOC
1998
66views more  MOC 1998»
13 years 11 months ago
Nonconforming finite element approximation of crystalline microstructure
Abstract. We consider a class of nonconforming finite element approximations of a simply laminated microstructure which minimizes the nonconvex variational problem for the deforma...
Bo Li, Mitchell Luskin
MOC
2000
83views more  MOC 2000»
13 years 11 months ago
On the problem of spurious eigenvalues in the approximation of linear elliptic problems in mixed form
In the approximation of linear elliptic operators in mixed form, it is well known that the so-called inf-sup and ellipticity in the kernel properties are sufficient (and, in a sens...
Daniele Boffi, Franco Brezzi, Lucia Gastaldi
DCG
2000
104views more  DCG 2000»
13 years 11 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
TRS
2008
13 years 11 months ago
Local and Global Approximations for Incomplete Data
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Jerzy W. Grzymala-Busse, Wojciech Rzasa
ADCM
2005
79views more  ADCM 2005»
13 years 11 months ago
Flexible piecewise approximations based on partition of unity
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
Weimin Han, Wing Kam Liu
ML
2008
ACM
248views Machine Learning» more  ML 2008»
13 years 11 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
JLP
2006
92views more  JLP 2006»
13 years 11 months ago
Exact real arithmetic using centred intervals and bounded error terms
Approximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on th...
Jens Blanck
JSCIC
2008
107views more  JSCIC 2008»
13 years 11 months ago
A Hierarchy of Approximations of the Master Equation Scaled by a Size Parameter
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...
Lars Ferm, Per Lötstedt, Andreas Hellander
ENTCS
2006
118views more  ENTCS 2006»
13 years 11 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson