Sciweavers

CORR
2002
Springer
87views Education» more  CORR 2002»
13 years 12 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
TSP
2008
115views more  TSP 2008»
13 years 12 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
TSP
2008
118views more  TSP 2008»
13 years 12 months ago
Approximating Functions From Sampled Fourier Data Using Spline Pseudofilters
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...
Ana Gabriela Martínez, Alvaro R. De Pierro
TNN
2008
181views more  TNN 2008»
13 years 12 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
JC
2007
63views more  JC 2007»
13 years 12 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...
Stephan Dahlke, Erich Novak, Winfried Sickel
TIT
2008
123views more  TIT 2008»
14 years 1 hour ago
Geometric Upper Bounds on Rates of Variable-Basis Approximation
In this paper, approximation by linear combinations of an increasing number n of computational units with adjustable parameters (such as perceptrons and radial basis functions) is ...
Vera Kurková, Marcello Sanguineti
TEC
2008
115views more  TEC 2008»
14 years 4 hour ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
IPL
2007
105views more  IPL 2007»
14 years 5 hour ago
Approximability of identifying codes and locating-dominating codes
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
Jukka Suomela
TC
2008
14 years 8 hour ago
Hardware Implementation Trade-Offs of Polynomial Approximations and Interpolations
This paper examines the hardware implementation trade-offs when evaluating functions via piecewise polynomial approximations and interpolations for precisions of up to 24 bits. In ...
Dong-U Lee, Ray C. C. Cheung, Wayne Luk, John D. V...
IM
2007
14 years 8 hour ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito